Transmission method, transmitter apparatus, reception method and receiver apparatus

ABSTRACT

Transmission quality is improved in an environment in which direct waves dominate in a transmission method for transmitting a plurality of modulated signals from a plurality of antennas at the same time. All data symbols used in data transmission of a modulated signal are precoded by hopping between precoding matrices so that the precoding matrix used to precode each data symbol and the precoding matrices used to precode data symbols that are adjacent to the data symbol in the frequency domain and the time domain all differ. A modulated signal with such data symbols arranged therein is transmitted.

TECHNICAL FIELD

The present invention relates to a precoding method, a precoding device, a transmission method, a transmission device, a reception method, and a reception device that in particular perform communication using a multi-antenna.

BACKGROUND ART

Multiple-Input Multiple-Output (MIMO) is a conventional example of a communication method using a multi-antenna. In multi-antenna communication, of which MIMO is representative, multiple transmission signals are each modulated, and each modulated signal is transmitted from a different antenna simultaneously in order to increase the transmission speed of data.

FIG. 28 shows an example of the structure of a transmission and reception device when the number of transmit antennas is two, the number of receive antennas is two, and the number of modulated signals for transmission (transmission streams) is two. In the transmission device, encoded data is interleaved, the interleaved data is modulated, and frequency conversion and the like is performed to generate transmission signals, and the transmission signals are transmitted from antennas. In this case, the method for simultaneously transmitting different modulated signals from different transmit antennas at the same time and at the same frequency (common frequency) is a spatial multiplexing MIMO system.

In this context, it has been suggested in Patent Literature 1 to use a transmission device provided with a different interleave pattern for each transmit antenna. In other words, the transmission device in FIG. 28 would have two different interleave patterns with respective interleaves (πa, πb). As shown in Non-Patent Literature 1 and Non-Patent Literature 2, reception quality is improved in the reception device by iterative performance of a detection method that uses soft values (the MIMO detector in FIG. 28).

Models of actual propagation environments in wireless communications include non-line of sight (NLOS), of which a Rayleigh fading environment is representative, and line of sight (LOS), of which a Rician fading environment is representative. When the transmission device transmits a single modulated signal, and the reception device performs maximal ratio combining on the signals received by a plurality of antennas and then demodulates and decodes the signal resulting from maximal ratio combining, excellent reception quality can be achieved in an LOS environment, in particular in an environment where the Rician factor is large, which indicates the ratio of the received power of direct waves versus the received power of scattered waves. However, depending on the transmission system (for example, spatial multiplexing MIMO system), a problem occurs in that the reception quality deteriorates as the Rician factor increases (see Non-Patent Literature 3).

FIGS. 29A and 29B show an example of simulation results of the Bit Error Rate (BER) characteristics (vertical axis: BER, horizontal axis: signal-to-noise power ratio (SNR)) for data encoded with low-density parity-check (LDPC) code and transmitted over a 2×2 (two transmit antennas, two receive antennas) spatial multiplexing MIMO system in a Rayleigh fading environment and in a Rician fading environment with Rician factors of K=3, 10, and 16 dB. FIG. 29A shows the BER characteristics of Max-log A Posteriori Probability (APP) without iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2), and FIG. 29B shows the BER characteristics of Max-log-APP with iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2) (number of iterations: five). As is clear from FIGS. 29A and 29B, regardless of whether iterative detection is performed, reception quality degrades in the spatial multiplexing MIMO system as the Rician factor increases. It is thus clear that the unique problem of “degradation of reception quality upon stabilization of the propagation environment in the spatial multiplexing MIMO system”, which does not exist in a conventional single modulation signal transmission system, occurs in the spatial multiplexing MIMO system.

Broadcast or multicast communication is a service directed towards line-of-sight users. The radio wave propagation environment between the broadcasting station and the reception devices belonging to the users is often an LOS environment. When using a spatial multiplexing MIMO system having the above problem for broadcast or multicast communication, a situation may occur in which the received electric field strength is high at the reception device, but degradation in reception quality makes it impossible to receive the service. In other words, in order to use a spatial multiplexing MIMO system in broadcast or multicast communication in both an NLOS environment and an LOS environment, there is a desire for development of a MIMO system that offers a certain degree of reception quality.

Non-Patent Literature 8 describes a method to select a codebook used in precoding (i.e. a precoding matrix, also referred to as a precoding weight matrix) based on feedback information from a communication partner. Non-Patent Literature 8 does not at all disclose, however, a method for precoding in an environment in which feedback information cannot be acquired from the communication partner, such as in the above broadcast or multicast communication.

On the other hand, Non-Patent Literature 4 discloses a method for switching the precoding matrix over time. This method can be applied even when no feedback information is available. Non-Patent Literature 4 discloses using a unitary matrix as the matrix for precoding and switching the unitary matrix at random but does not at all disclose a method applicable to degradation of reception quality in the above-described LOS environment. Non-Patent Literature 4 simply recites hopping between precoding matrices at random. Obviously, Non-Patent Literature 4 makes no mention whatsoever of a precoding method, or a structure of a precoding matrix, for remedying degradation of reception quality in an LOS environment.

CITATION LIST Patent Literature

[Patent Literature 1]

-   WO 2005/050885

Non-Patent Literature

[Non-Patent Literature 1]

-   “Achieving near-capacity on a multiple-antenna channel”, IEEE     Transaction on Communications, vol. 51, no. 3, pp. 389-399, March     2003.

[Non-Patent Literature 2]

-   “Performance analysis and design optimization of LDPC-coded MIMO     OFDM systems”, IEEE Trans. Signal Processing, vol. 52, no. 2, pp.     348-361, February 2004.

[Non-Patent Literature 3]

-   “BER performance evaluation in 2×2 MIMO spatial multiplexing systems     under Rician fading channels”, IEICE Trans. Fundamentals, vol.     E91-A, no. 10, pp. 2798-2807, October 2008.

[Non-Patent Literature 4]

-   “Turbo space-time codes with time varying linear transformations”,     IEEE Trans. Wireless communications, vol. 6, no. 2, pp. 486-493,     February 2007.

[Non-Patent Literature 5]

-   “Likelihood function for QR-MLD suitable for soft-decision turbo     decoding and its performance”, IEICE Trans. Commun., vol. E88-B, no.     1, pp. 47-57, January 2004.

[Non-Patent Literature 6]

-   “A tutorial on ‘parallel concatenated (Turbo) coding’, ‘Turbo     (iterative) decoding’ and related topics”, The Institute of     Electronics, Information, and Communication Engineers, Technical     Report IT 98-51.

[Non-Patent Literature 7]

-   “Advanced signal processing for PLCs: Wavelet-OFDM”, Proc. of IEEE     International symposium on ISPLC 2008, pp. 187-192, 2008.

[Non-Patent Literature 8]

-   D. J. Love, and R. W. Heath, Jr., “Limited feedback unitary     precoding for spatial multiplexing systems”, IEEE Trans. Inf.     Theory, vol. 51, no. 8, pp. 2967-2976, August 2005.

[Non-Patent Literature 9]

-   DVB Document A122, Framing structure, channel coding and modulation     for a second generation digital terrestrial television broadcasting     system, (DVB-T2), June 2008.

[Non-Patent Literature 10]

-   L. Vangelista, N. Benvenuto, and S. Tomasin, “Key technologies for     next-generation terrestrial digital television standard DVB-T2”,     IEEE Commun. Magazine, vol. 47, no. 10, pp. 146-153, October 2009.

[Non-Patent Literature 11]

-   T. Ohgane, T. Nishimura, and Y. Ogawa, “Application of space     division multiplexing and those performance in a MIMO channel”,     IEICE Trans. Commun., vol. E88-B, no. 5, pp. 1843-1851, May 2005.

SUMMARY OF INVENTION Technical Problem

It is an object of the present invention to provide a MIMO system that improves reception quality in an LOS environment.

Solution to Problem

In order to solve the above problems, an aspect of the present invention is a transmission method for transmitting a first transmission signal from one or more first outputs and a second transmission signal from one or more second outputs that differ from the first outputs, the first and the second transmission signal being generated by using one of a plurality of precoding matrices to precode a first and a second modulated signal modulated in accordance with a modulation method, the first and the second modulated signal being composed of an in-phase component and a quadrature-phase component, the precoding matrix used to generate the first and the second transmission signal being regularly switched to another one of the precoding matrices, the transmission method comprising the steps of: for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, when a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which the second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, and two fourth symbols adjacent to the first symbol in the time domain are both data symbols, generating the first transmission signal by precoding the first symbol, the two third symbols, and the two fourth symbols, the first symbol being precoded with a different precoding matrix than each of the two third symbols and the two fourth symbols; generating the second transmission signal by precoding the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain each with the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols; outputting the generated first transmission signal from the one or more first outputs; and outputting the generated second transmission signal from the one or more second outputs.

Another aspect of the present invention is a transmission device for transmitting a first transmission signal from one or more first outputs and a second transmission signal from one or more second outputs that differ from the first outputs, the first and the second transmission signal being generated by using one of a plurality of precoding matrices to precode a first and a second modulated signal modulated in accordance with a modulation method, the first and the second modulated signal being composed of an in-phase component and a quadrature-phase component, the precoding matrix used to generate the first and the second transmission signal being regularly switched to another one of the precoding matrices, the transmission device comprising: a precoding weight generating unit operable to allocate precoding matrices, wherein for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, when a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which a second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, and two fourth symbols adjacent to the first symbol in the time domain are both data symbols, the precoding weight generating unit allocates precoding matrices to the two third symbols and the two fourth symbols that differ from the precoding matrix allocated to the first symbol, and allocates the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols to each of the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain; a weighting unit operable to generate the first transmission signal and the second transmission signal by weighting the first modulated signal and the second modulated signal with the allocated precoding matrices; and a transmission unit operable to transmit the generated first transmission signal from the one or more first outputs and the generated second transmission signal from the one or more second outputs.

Another aspect of the present invention is a reception method for receiving a first and a second transmission signal precoded and transmitted by a transmission device, wherein the first and the second transmission signal are generated by using one of a plurality of precoding matrices, while regularly hopping between the precoding matrices, to precode a first and a second modulated signal modulated in accordance with a modulation method, the first and the second modulated signal being composed of an in-phase component and a quadrature-phase component, for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, when a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which the second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, and two fourth symbols adjacent to the first symbol in the time domain are both data symbols, then the first transmission signal is generated by precoding the first symbol, the two third symbols, and the two fourth symbols, the first symbol being precoded with a different precoding matrix than each of the two third symbols and the two fourth symbols, and the second transmission signal is generated by precoding the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain with the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols, the reception method comprising the steps of: receiving the first and the second transmission signal; and demodulating the first and the second transmission signal using a demodulation method in accordance with the modulation method and performing error correction decoding to obtain data.

Another aspect of the present invention is a reception device for receiving a first and a second transmission signal precoded and transmitted by a transmission device, wherein the first and the second transmission signal are generated by using one of a plurality of precoding matrices, while regularly hopping between the precoding matrices, to precode a first and a second modulated signal modulated in accordance with a modulation method, the first and the second modulated signal being composed of an in-phase component and a quadrature-phase component, for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, when a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which the second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, and two fourth symbols adjacent to the first symbol in the time domain are both data symbols, then the first transmission signal is generated by precoding the first symbol, the two third symbols, and the two fourth symbols, the first symbol being precoded with a different precoding matrix than each of the two third symbols and the two fourth symbols, the second transmission signal is generated by precoding the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain with the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols, the first and the second transmission signal are received, and the first and the second transmission signal are demodulated using a demodulation method in accordance with the modulation method and performing error correction decoding to obtain data.

With the above aspects of the present invention, a modulated signal is generated by performing precoding while hopping between precoding matrices so that among a plurality of precoding matrices, a precoding matrix used for at least one data symbol and precoding matrices that are used for data symbols that are adjacent to the data symbol in either the frequency domain or the time domain all differ. Therefore, reception quality in an LOS environment is improved in response to the design of the plurality of precoding matrices.

Advantageous Effects of Invention

With the above structure, the present invention provides a transmission method, a reception method, a transmission device, and a reception device that remedy degradation of reception quality in an LOS environment, thereby providing high-quality service to LOS users during broadcast or multicast communication.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is an example of the structure of a transmission device and a reception device in a spatial multiplexing MIMO system.

FIG. 2 is an example of a frame structure.

FIG. 3 is an example of the structure of a transmission device when adopting a method of hopping between precoding weights.

FIG. 4 is an example of the structure of a transmission device when adopting a method of hopping between precoding weights.

FIG. 5 is an example of a frame structure.

FIG. 6 is an example of a method of hopping between precoding weights.

FIG. 7 is an example of the structure of a reception device.

FIG. 8 is an example of the structure of a signal processing unit in a reception device.

FIG. 9 is an example of the structure of a signal processing unit in a reception device.

FIG. 10 shows a decoding processing method.

FIG. 11 is an example of reception conditions.

FIGS. 12A and 12B are examples of BER characteristics.

FIG. 13 is an example of the structure of a transmission device when adopting a method of hopping between precoding weights.

FIG. 14 is an example of the structure of a transmission device when adopting a method of hopping between precoding weights.

FIGS. 15A and 15B are examples of a frame structure.

FIGS. 16A and 16B are examples of a frame structure.

FIGS. 17A and 17B are examples of a frame structure.

FIGS. 18A and 18B are examples of a frame structure.

FIGS. 19A and 19B are examples of a frame structure.

FIG. 20 shows positions of poor reception quality points.

FIG. 21 shows positions of poor reception quality points.

FIG. 22 is an example of a frame structure.

FIG. 23 is an example of a frame structure.

FIGS. 24A and 24B are examples of mapping methods.

FIGS. 25A and 25B are examples of mapping methods.

FIG. 26 is an example of the structure of a weighting unit.

FIG. 27 is an example of a method for reordering symbols.

FIG. 28 is an example of the structure of a transmission device and a reception device in a spatial multiplexing MIMO system.

FIGS. 29A and 29B are examples of BER characteristics.

FIG. 30 is an example of a 2×2 MIMO spatial multiplexing MIMO system.

FIGS. 31A and 31B show positions of poor reception points.

FIG. 32 shows positions of poor reception points.

FIGS. 33A and 33B show positions of poor reception points.

FIG. 34 shows positions of poor reception points.

FIGS. 35A and 35B show positions of poor reception points.

FIG. 36 shows an example of minimum distance characteristics of poor reception points in a complex plane.

FIG. 37 shows an example of minimum distance characteristics of poor reception points in a complex plane.

FIGS. 38A and 38B show positions of poor reception points.

FIGS. 39A and 39B show positions of poor reception points.

FIG. 40 is an example of the structure of a transmission device in Embodiment 7.

FIG. 41 is an example of the frame structure of a modulated signal transmitted by the transmission device.

FIGS. 42A and 42B show positions of poor reception points.

FIGS. 43A and 43B show positions of poor reception points.

FIGS. 44A and 44B show positions of poor reception points.

FIGS. 45A and 45B show positions of poor reception points.

FIGS. 46A and 46B show positions of poor reception points.

FIGS. 47A and 47B are examples of a frame structure in the time and frequency domains.

FIGS. 48A and 48B are examples of a frame structure in the time and frequency domains.

FIG. 49 shows a signal processing method.

FIG. 50 shows the structure of modulated signals when using space-time block coding.

FIG. 51 is a detailed example of a frame structure in the time and frequency domains.

FIG. 52 is an example of the structure of a transmission device.

FIG. 53 is an example of a structure of the modulated signal generating units #1-#M in FIG. 52.

FIG. 54 shows the structure of the OFDM related processors (5207_1 and 5207_2) in FIG. 52.

FIGS. 55A and 55B are detailed examples of a frame structure in the time and frequency domains.

FIG. 56 is an example of the structure of a reception device.

FIG. 57 shows the structure of the OFDM related processors (5600_X and 5600_Y) in FIG. 56.

FIGS. 58A and 58B are detailed examples of a frame structure in the time and frequency domains.

FIG. 59 is an example of a broadcasting system.

FIGS. 60A and 60B show positions of poor reception points.

FIGS. 61A and 61B are examples of frame structure of a modulated signal yielding high reception quality.

FIGS. 62A and 62B are examples of frame structure of a modulated signal not yielding high reception quality.

FIGS. 63A and 63B are examples of symbol arrangement of a modulated signal yielding high reception quality.

FIGS. 64A and 64B are examples of symbol arrangement of a modulated signal yielding high reception quality.

FIGS. 65A and 65B are examples of symbol arrangement in which the frequency domain and the time domain in the examples of symbol arrangement in FIGS. 63A and 63B are switched.

FIGS. 66A and 66B are examples of symbol arrangement in which the frequency domain and the time domain in the examples of symbol arrangement in FIGS. 64A and 64B are switched.

FIGS. 67A, 67B, 67C, and 67D show examples of the order of symbol arrangement.

FIGS. 68A, 68B, 68C, and 68D show examples of symbol arrangement when pilot symbols are not inserted between data symbols.

FIGS. 69A and 69B show insertion of pilot symbols between data symbols.

FIGS. 70A and 70B are examples of symbol arrangement showing locations where a symbols arrangement yielding high reception quality cannot be achieved when pilot symbols are simply inserted.

FIGS. 71A and 71B show examples of symbol arrangement when pilot symbols are inserted between data symbols.

FIGS. 72A and 72B are examples of frame structure of a modulated signal yielding high reception quality wherein the range over which precoding matrices differ is expanded.

FIGS. 73A and 73B are examples of frame structure of a modulated signal yielding high reception quality wherein the range over which precoding matrices differ is expanded.

FIGS. 74A and 74B are examples of symbol arrangement wherein the range over which precoding matrices differ is expanded.

FIGS. 75A and 75B are examples of frame structure of a modulated signal yielding high reception quality wherein the range over which precoding matrices differ is expanded.

FIGS. 76A and 76B are examples, corresponding to FIGS. 75A and 75B, of symbol arrangement yielding high reception quality.

FIGS. 77A and 77B are examples of frame structure of a modulated signal yielding high reception quality wherein the range over which precoding matrices differ is expanded.

FIGS. 78A and 78B are examples, corresponding to FIGS. 77A and 77B, of symbol arrangement yielding high reception quality.

FIGS. 79A and 79B are examples of symbol arrangement wherein the range over which precoding matrices differ is expanded and pilot symbols are inserted between data symbols.

FIGS. 80A and 80B are examples of symbol arrangement in which a different method of allocating precoding matrices than FIGS. 70A and 70B is used.

FIGS. 81A and 81B are examples of symbol arrangement in which a different method of allocating precoding matrices than FIGS. 70A and 70B is used.

FIG. 82 shows the overall structure of a digital broadcasting system.

FIG. 83 is a block diagram showing an example of the structure of a reception device.

FIG. 84 shows the structure of multiplexed data.

FIG. 85 schematically shows how each stream is multiplexed in the multiplexed data.

FIG. 86 shows in detail how a video stream is stored in a sequence of PES packets.

FIG. 87 shows the structure of a TS packet and a source packet in multiplexed data.

FIG. 88 shows the data structure of a PMT.

FIG. 89 shows the internal structure of multiplexed data information.

FIG. 90 shows the internal structure of stream attribute information.

FIG. 91 is a structural diagram of a video display and an audio output device.

DESCRIPTION OF EMBODIMENTS

The following describes embodiments of the present invention with reference to the drawings.

Embodiment 1

The following describes the transmission method, transmission device, reception method, and reception device of the present embodiment.

Prior to describing the present embodiment, an overview is provided of a transmission method and decoding method in a conventional spatial multiplexing MIMO system.

FIG. 1 shows the structure of an N_(t)×N_(r) spatial multiplexing MIMO system. An information vector z is encoded and interleaved. As output of the interleaving, an encoded bit vector u=(u₁, . . . , u_(Nt)) is acquired. Note that u_(i)=(u_(i1), . . . , u_(iM)) (where M is the number of transmission bits per symbol). Letting the transmission vector s=(s₁, . . . , s_(Nt))^(T) and the transmission signal from transmit antenna #1 be represented as s_(i)=map(u_(i)), the normalized transmission energy is represented as E{|s_(i)|²}=Es/Nt (E_(s) being the total energy per channel). Furthermore, letting the received vector be y=(y₁, . . . y_(Nr))^(T), the received vector is represented as in Equation 1.

Math 1

$\begin{matrix} \begin{matrix} {y = \left( {y_{1},\ldots\mspace{14mu},y_{Nr}} \right)^{T}} \\ {= {{H_{NtNr}s} + n}} \end{matrix} & {{Equation}\mspace{14mu} 1} \end{matrix}$

In this Equation, H_(NtNr) is the channel matrix, n=(n₁, . . . , n_(Nr))^(T) is the noise vector, and n_(i) is the i.i.d. complex white Gaussian noise with 0 mean and variance σ². From the relationship between transmission symbols and reception symbols that is induced at the reception device, the probability for the received vector may be provided as a multi-dimensional Gaussian distribution, as in Equation 2.

Math 2

$\begin{matrix} {{p\left( y \middle| u \right)} = {\frac{1}{\left( {2\pi\;\sigma^{2}} \right)^{N_{r}}}{\exp\left( {{- \frac{1}{2\sigma^{2}}}{{y - {{Hs}(u)}}}^{2}} \right)}}} & {{Equation}\mspace{14mu} 2} \end{matrix}$

Here, a reception device that performs iterative decoding composed of an outer soft-in/soft-out decoder and a MIMO detector, as in FIG. 1, is considered. The vector of a log-likelihood ratio (L-value) in FIG. 1 is represented as in Equations 3-5.

Math 3

$\begin{matrix} {{L(u)} = \left( {{L\left( u_{1} \right)},\ldots\mspace{14mu},{L\left( u_{N_{t}} \right)}} \right)^{T}} & {{Equation}\mspace{14mu} 3} \end{matrix}$ Math 4 L(u _(i))=(L(u _(i1)), . . . ,L(u _(iM)))  Equation 4 Math 5

$\begin{matrix} {{L\left( u_{ij} \right)} = {\ln\;\frac{P\left( {u_{ij} = {+ 1}} \right)}{P\left( {u_{ij} = {- 1}} \right)}}} & {{Equation}\mspace{14mu} 5} \end{matrix}$ <Iterative Detection Method>

The following describes iterative detection of MIMO signals in the N_(t)×N_(r) spatial multiplexing MIMO system.

The log-likelihood ratio of u_(mn) is defined as in Equation 6.

Math 6

$\begin{matrix} {{L\left( u_{mn} \middle| y \right)} = {\ln\;\frac{P\left( {u_{mn} = \left. {+ 1} \middle| y \right.} \right)}{P\left( {u_{mn} = \left. {- 1} \middle| y \right.} \right)}}} & {{Equation}\mspace{14mu} 6} \end{matrix}$

From Bayes' theorem, Equation 6 can be expressed as Equation 7.

Math 7

$\begin{matrix} \begin{matrix} {{L\left( u_{mn} \middle| y \right)} = {\ln\frac{{P\left( {u_{mn} = {+ 1}} \right)}{{P\left( {u_{mn} = {+ 1}} \right)}/{p(y)}}}{{P\left( {u_{mn} = {- 1}} \right)}{{P\left( {u_{mn} = {- 1}} \right)}/{p(y)}}}}} \\ {= {{\ln\frac{P\left( {u_{mn} = {+ 1}} \right)}{P\left( {u_{mn} = {- 1}} \right)}} + {\ln\frac{P\left( {\left. y \middle| u_{mn} \right. = {+ 1}} \right)}{P\left( {\left. y \middle| u_{mn} \right. = {- 1}} \right)}}}} \\ {= {{\ln\frac{P\left( {u_{mn} = {+ 1}} \right)}{P\left( {u_{mn} = {- 1}} \right)}} +}} \\ {\ln\frac{\sum\limits_{U_{{mn},{+ 1}}}{{p\left( y \middle| u \right)}{p\left( u \middle| u_{mn} \right)}}}{\sum\limits_{U_{{mn},{- 1}}}{{p\left( y \middle| u \right)}{p\left( u \middle| u_{mn} \right)}}}} \end{matrix} & {{Equation}\mspace{14mu} 7} \end{matrix}$

Let U_(mn,±1)={u|u_(mn)=±1}. When approximating ln Σa_(j)˜max ln a_(j), an approximation of Equation 7 can be sought as Equation 8. Note that the above symbol “˜” indicates approximation.

Math 8

$\begin{matrix} {{L\left( u_{mn} \middle| y \right)} \approx {{\ln\frac{P\left( {u_{mn} = {+ 1}} \right)}{P\left( {u_{mn} = {- 1}} \right)}} + {\max\limits_{{Umn},{+ 1}}\left\{ {{\ln\;{p\left( y \middle| u \right)}} + {P\left( u \middle| u_{mn} \right)}} \right\}} - {\max\limits_{{Umn},{- 1}}\left\{ {{\ln\;{p\left( y \middle| u \right)}} + {P\left( u \middle| u_{mn} \right)}} \right\}}}} & {{Equation}\mspace{14mu} 8} \end{matrix}$

P(u|u_(mn)) and ln P(u|u_(mn)) in Equation 8 are represented as follows.

Math 9

$\begin{matrix} {{P\left( u \middle| u_{mn} \right)} = {{\prod\limits_{{({ij})} \neq {({mn})}}{P\left( u_{ij} \right)}} = {\prod\limits_{{({ij})} \neq {({mn})}}\frac{\exp\left( \frac{u_{ij}{L\left( u_{ij} \right)}}{2} \right)}{{\exp\left( \frac{L\left( u_{ij} \right)}{2} \right)} + {\exp\left( {- \frac{L\left( u_{ij} \right)}{2}} \right)}}}}} & {{Equation}\mspace{14mu} 9} \end{matrix}$ Math 10

$\begin{matrix} {{\ln\;{P\left( u \middle| u_{mn} \right)}} = {\left( {\sum\limits_{ij}{\ln\;{P\left( u_{ij} \right)}}} \right) - {\ln\;{P\left( u_{mn} \right)}}}} & {{Equation}\mspace{14mu} 10} \end{matrix}$ Math 11

$\begin{matrix} \begin{matrix} {{\ln\;{P\left( u_{ij} \right)}} = {{\frac{1}{2}u_{ij}{P\left( u_{ij} \right)}} - {\ln\left( {{\exp\left( \frac{L\left( u_{ij} \right)}{2} \right)} + {\exp\left( {- \frac{L\left( u_{ij} \right)}{2}} \right)}} \right)}}} \\ {\approx \begin{matrix} {{\frac{1}{2}u_{ij}{L\left( u_{ij} \right)}} - {\frac{1}{2}{{L\left( u_{ij} \right)}}}} & {{{for}\mspace{14mu}{{L\left( u_{ij} \right)}}} > 2} \end{matrix}} \\ {= {{\frac{L\left( u_{ij} \right)}{2}}\left( {{u_{ij}{{sign}\left( {L\left( u_{ij} \right)} \right)}} - 1} \right)}} \end{matrix} & {{Equation}\mspace{14mu} 11} \end{matrix}$

Incidentally, the logarithmic probability of the equation defined in Equation 2 is represented in Equation 12.

Math 12

$\begin{matrix} {{\ln\;{P\left( y \middle| u \right)}} = {{{- \frac{N_{r}}{2}}{\ln\left( {2\pi\;\sigma^{2}} \right)}} - {\frac{1}{2\sigma^{2}}{{y - {{Hs}(u)}}}^{2}}}} & {{Equation}\mspace{14mu} 12} \end{matrix}$

Accordingly, from Equations 7 and 13, in MAP or A Posteriori Probability (APP), the a posteriori L-value is represented as follows.

Math 13

$\begin{matrix} {{L\left( u_{mn} \middle| y \right)} = {\ln\frac{\sum\limits_{U_{{mn},{+ 1}}}{\exp\left\{ {{{- \frac{1}{2\sigma^{2}}}{{y - {{Hs}(u)}}}^{2}} + {\sum\limits_{ij}{\ln\;{P\left( u_{ij} \right)}}}} \right\}}}{\sum\limits_{U_{{mn},{- 1}}}{\exp\left\{ {{{- \frac{1}{2\sigma^{2}}}{{y - {{Hs}(u)}}}^{2}} + {\sum\limits_{ij}{\ln\;{P\left( u_{ij} \right)}}}} \right\}}}}} & {{Equation}\mspace{14mu} 13} \end{matrix}$

Hereinafter, this is referred to as iterative APP decoding. From Equations 8 and 12, in the log-likelihood ratio utilizing Max-Log approximation (Max-Log APP), the a posteriori L-value is represented as follows.

Math 14

$\begin{matrix} {{L\left( u_{mn} \middle| y \right)} \approx {{\max\limits_{{Umn},{+ 1}}\left\{ {\Psi\left( {u,y,{L(u)}} \right)} \right\}} - {\max\limits_{{Umn},{- 1}}\left\{ {\Psi\left( {u,y,{L(u)}} \right)} \right\}}}} & {{Equaiton}\mspace{14mu} 14} \end{matrix}$ Math 15

$\begin{matrix} {{\Psi\left( {u,y,{L(u)}} \right)} = {{{- \frac{1}{2\sigma^{2}}}{{y - {{Hs}(u)}}}^{2}} + {\sum\limits_{ij}{\ln\;{P\left( u_{ij} \right)}}}}} & {{Equation}\mspace{14mu} 15} \end{matrix}$

Hereinafter, this is referred to as iterative Max-log APP decoding. The extrinsic information required in an iterative decoding system can be sought by subtracting prior inputs from Equations 13 and 14.

<System Model>

FIG. 28 shows the basic structure of the system that is related to the subsequent description. This system is a 2×2 spatial multiplexing MIMO system. There is an outer encoder for each of streams A and B. The two outer encoders are identical LDPC encoders. (Here, a structure using LDPC encoders as the outer encoders is described as an example, but the error correction coding used by the outer encoder is not limited to LDPC coding. The present invention may similarly be embodied using other error correction coding such as turbo coding, convolutional coding, LDPC convolutional coding, and the like. Furthermore, each outer encoder is described as having a transmit antenna, but the outer encoders are not limited to this structure. A plurality of transmit antennas may be used, and the number of outer encoders may be one. Also, a greater number of outer encoders may be used than the number of transmit antennas.) The streams A and B respectively have interleavers (π_(a), π_(b)). Here, the modulation scheme is 2^(h)-QAM (with h bits transmitted in one symbol).

The reception device performs iterative detection on the above MIMO signals (iterative APP (or iterative Max-log APP) decoding). Decoding of LDPC codes is performed by, for example, sum-product decoding.

FIG. 2 shows a frame structure and lists the order of symbols after interleaving. In this case, (i_(a), j_(a)), (i_(b), j_(b)) are represented by the following Equations.

Math 16 (i _(a) ,j _(a))=π_(a)(Ω_(ia,ja) ^(a))  Equation 16 Math 17 (i _(b) ,j _(b))=π_(b)(Ω_(ib,jb) ^(a))  Equation 17

In this case, i_(a), i_(b) indicate the order of symbols after interleaving, j_(a), j_(b) indicate the bit positions (j_(a), j_(b)=1, . . . , h) in the modulation scheme, π_(a), π_(b) indicate the interleavers for the streams A and B, and Ω^(a) _(ia, ja), Ω^(b) _(ib, jb) indicate the order of data in streams A and B before interleaving. Note that FIG. 2 shows the frame structure for i_(a)=i_(b).

<Iterative Decoding>

The following is a detailed description of the algorithms for sum-product decoding used in decoding of LDPC codes and for iterative detection of MIMO signals in the reception device.

Sum-Product Decoding

Let a two-dimensional M×N matrix H={H_(mn)} be the check matrix for LDPC codes that are targeted for decoding. Subsets A(m), B(n) of the set [1, N]={1, 2, . . . , N} are defined by the following Equations.

Math 18 A(m)≡{n:H _(mn)=1}  Equation 18 Math 19 B(n)≡{m:H _(mn)=1}  Equation 19

In these Equations, A(m) represents the set of column indices of 1's in the m^(th) column of the check matrix H, and B(n) represents the set of row indices of 1's in the n^(th) row of the check matrix H. The algorithm for sum-product decoding is as follows.

Step A⋅1 (initialization): let a priori value log-likelihood ratio β_(mn)=0 for all combinations (m, n) satisfying H_(mn)=1. Assume that the loop variable (the number of iterations) l_(sum)=1 and the maximum number of loops is set to l_(sum, max).

Step A⋅2 (row processing): the extrinsic value log-likelihood ratio α_(mn) is updated for all combinations (m, n) satisfying H_(mn)=1 in the order of m=1, 2, . . . , M, using the following updating Equations.

Math 20

$\begin{matrix} {\alpha_{mn} = {\left( {\prod\limits_{n^{\prime} \in {{A{(m)}}\backslash\; n}}{{sign}\left( {\lambda_{n^{\prime}} + \beta_{{mn}^{\prime}}} \right)}} \right) \times {f\left( {\sum\limits_{n^{\prime} \in {{A{(m)}}\backslash\; n}}{f\left( {\lambda_{n^{\prime}} + \beta_{{mn}^{\prime}}} \right)}} \right)}}} & {{Equation}\mspace{14mu} 20} \end{matrix}$ Math 21

$\begin{matrix} {{{sign}(x)} \equiv \left\{ \begin{matrix} 1 & {x \geq 0} \\ {- 1} & {x < 0} \end{matrix} \right.} & {{Equation}\mspace{14mu} 21} \end{matrix}$ Math 22

$\begin{matrix} {{f(x)} \equiv {\ln\frac{{\exp(x)} + 1}{{\exp(x)} - 1}}} & {{Equation}\mspace{14mu} 22} \end{matrix}$

In these Equations, f represents a Gallager function. Furthermore, the method of seeking λ_(n) is described in detail later.

Step A⋅3 (column processing): the extrinsic value log-likelihood ratio β_(mn) is updated for all combinations (m, n) satisfying H_(mn)=1 in the order of n=1, 2, . . . , N, using the following updating Equation.

Math 23

$\begin{matrix} {\beta_{mn} = {\sum\limits_{m^{\prime} \in {{B{(n)}}\backslash m}}\alpha_{m^{\prime}n}}} & {{Equation}\mspace{14mu} 23} \end{matrix}$

Step A⋅4 (calculating a log-likelihood ratio): the log-likelihood ratio L_(n) is sought for nϵ[1, N] by the following Equation.

Math 24

$\begin{matrix} {L_{n} = {{\sum\limits_{m^{\prime} \in {{B{(n)}}\backslash m}}\alpha_{m^{\prime}n}} + \lambda_{n}}} & {{Equation}\mspace{14mu} 24} \end{matrix}$

Step A⋅5 (count of the number of iterations): if l_(sum)<l_(sum, max), then l_(sum) is incremented, and processing returns to step A⋅2. If l_(sum)=l_(sum, max), the sum-product decoding in this round is finished.

The operations in one sum-product decoding have been described. Subsequently, iterative MIMO signal detection is performed. In the variables m, n, α_(mn), β_(mn), λ_(n), and L_(n), used in the above description of the operations of sum-product decoding, the variables in stream A are m_(a), n_(a), α^(a) _(mana), β^(a) _(mana), λ_(na), and L_(na), and the variables in stream B are m_(b), n_(b), α^(b) _(mbnb), β^(b) _(mbnb), λ_(nb), and L_(nb).

<Iterative MIMO Signal Detection>

The following describes the method of seeking λ_(n) in iterative MIMO signal detection in detail.

The following Equation holds from Equation 1.

Math 25

$\begin{matrix} \begin{matrix} {{y(t)} = \left( {{y_{1}(t)},{y_{2}(t)}} \right)^{T}} \\ {= {{{H_{22}(t)}{s(t)}} + {n(t)}}} \end{matrix} & {{Equation}\mspace{14mu} 25} \end{matrix}$

The following Equations are defined from the frame structures of FIG. 2 and from Equations 16 and 17.

Math 26 n _(a)=Ω_(ia,ja) ^(a)  Equation 26 Math 27 n _(b)=Ω_(ib,jb) ^(b)  Equation 27

In this case, n_(a), n_(b)ϵ[1, N]. Hereinafter, λ_(na), L_(na), λ_(nb), and L_(nb), where the number of iterations of iterative MIMO signal detection is k, are represented as λ_(k, na), L_(k, na), λ_(k, nb), and L_(k, nb).

Step B⋅1 (initial detection; k=0): λ_(0, na) and λ_(0, nb) are sought as follows in the case of initial detection.

In iterative APP decoding:

Math 28

$\begin{matrix} {\lambda_{0,n_{X}} = {\ln\frac{\sum\limits_{U_{0,n_{X},{+ 1}}}{\exp\left\{ {{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}} \right\}}}{\sum\limits_{U_{0,n_{X},{- 1}}}{\exp\left\{ {{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}} \right\}}}}} & {{Equation}\mspace{14mu} 28} \end{matrix}$

In iterative Max-log APP decoding:

Math 29

$\begin{matrix} {\lambda_{0,n_{X}} = {{\max\limits_{U_{0,n_{X},{+ 1}}}\left\{ {\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)}} \right)} \right\}} - {\max\limits_{U_{0,n_{X},{- 1}}}\left\{ {\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)}} \right)} \right\}}}} & {{Equation}\mspace{14mu} 29} \end{matrix}$ Math 30

$\begin{matrix} {{\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)}} \right)} = {{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}}} & {{Equation}\mspace{14mu} 30} \end{matrix}$

Here, let X=a, b. Then, assume that the number of iterations of iterative MIMO signal detection is l_(mimo)=0 and the maximum number of iterations is set to l_(mimo, max).

Step B⋅2 (iterative detection; the number of iterations k): λ_(k, na) and λ_(k, nb), where the number of iterations is k, are represented as in Equations 31-34, from Equations 11, 13-15, 16, and 17. Let (X, Y)=(a, b),(b, a).

In iterative APP decoding:

Math 31

$\begin{matrix} {\lambda_{k,n_{X}} = {{L_{{k - 1},\Omega_{{iX},{jX}}^{X}}\left( u_{\Omega_{{iX},{jX}}^{X}} \right)} + {\ln\frac{\begin{matrix} {\sum\limits_{U_{k,n_{X},{+ 1}}}{\exp\left\{ {{{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}} +} \right.}} \\ \left. {\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)} \right\} \end{matrix}}{\begin{matrix} {\sum\limits_{U_{k,n_{X},{- 1}}}{\exp\left\{ {{{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}} +} \right.}} \\ \left. {\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)} \right\} \end{matrix}}}}} & {{Equation}\mspace{14mu} 31} \end{matrix}$ Math 32

$\begin{matrix} {{\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)} = {{\sum\limits_{\underset{\gamma \neq {jX}}{\gamma = 1}}^{h}{{\frac{L_{{k - 1},\Omega_{{iX},\gamma}^{X}}\left( u_{\Omega_{{iX},\gamma}^{X}} \right)}{2}}\left( {{u_{\Omega_{{iX},\gamma}^{X}}{{sign}\left( {L_{{k - 1},\Omega_{{iX},\gamma}^{X}}\left( u_{\Omega_{{iX},\gamma}^{X}} \right)} \right)}} - 1} \right)}} + {\sum\limits_{\gamma = 1}^{h}{{\frac{L_{{k - 1},\Omega_{{iX},\gamma}^{Y}}\left( u_{\Omega_{{iX},\gamma}^{Y}} \right)}{2}}\left( {{u_{\Omega_{{iX},\gamma}^{Y}}{{sign}\left( {L_{{k - 1},\Omega_{{iX},\gamma}^{Y}}\left( u_{\Omega_{{iX},\gamma}^{Y}} \right)} \right)}} - 1} \right)}}}} & {{Equation}\mspace{14mu} 32} \end{matrix}$

In iterative Max-log APP decoding:

Math 33

$\begin{matrix} {\lambda_{k,n_{X}} = {{L_{{k - 1},\Omega_{{iX},{jX}}^{X}}\left( u_{\Omega_{{iX},{jX}}^{X}} \right)} + {\max\limits_{U_{k,n_{X},{+ 1}}}\left\{ {\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)},{\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)}} \right)} \right\}} - {\max\limits_{U_{k,n_{X},{- 1}}}\left\{ {\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)},{\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)}} \right)} \right\}}}} & {{Equation}\mspace{14mu} 33} \end{matrix}$ Math 34

$\begin{matrix} {{\Psi\left( {{u\left( i_{X} \right)},{y\left( i_{X} \right)},{\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)}} \right)} = {{{- \frac{1}{2\sigma^{2}}}{{{y\left( i_{X} \right)} - {{H_{22}\left( i_{X} \right)}{s\left( {u\left( i_{X} \right)} \right)}}}}^{2}} + {\rho\left( u_{\Omega_{{iX},{jX}}^{X}} \right)}}} & {{Equation}\mspace{14mu} 34} \end{matrix}$

Step B⋅3 (counting the number of iterations and estimating a codeword): increment l_(mimo) if l_(mimo)<l_(mimo, max), and return to step B⋅2. Assuming that l_(mimo)=l_(mimo, max), the estimated codeword is sought as in the following Equation.

Math 35

$\begin{matrix} {{\hat{u}}_{n_{X}} = \left\{ \begin{matrix} 1 & {L_{l_{mimo},n_{X}} \geq 0} \\ {- 1} & {L_{l_{mimo},n_{X}} < 0} \end{matrix} \right.} & {{Equation}\mspace{14mu} 35} \end{matrix}$

Here, let X=a, b.

FIG. 3 is an example of the structure of a transmission device 300 in the present embodiment. An encoder 302A receives information (data) 301A and a frame structure signal 313 as inputs and, in accordance with the frame structure signal 313, performs error correction coding such as convolutional coding, LDPC coding, turbo coding, or the like, outputting encoded data 303A. (The frame structure signal 313 includes information such as the error correction method used for error correction coding of data, the coding rate, the block length, and the like. The encoder 302A uses the error correction method indicated by the frame structure signal 313. Furthermore, the error correction method may be switched.)

An interleaver 304A receives the encoded data 303A and the frame structure signal 313 as inputs and performs interleaving, i.e. changing the order of the data, to output interleaved data 305A. (The method of interleaving may be switched based on the frame structure signal 313.)

A mapper 306A receives the interleaved data 305A and the frame structure signal 313 as inputs, performs modulation such as Quadrature Phase Shift Keying (QPSK), 16 Quadrature Amplitude Modulation (16QAM), 64 Quadrature Amplitude Modulation (64QAM), or the like, and outputs a resulting baseband signal 307A. (The method of modulation may be switched based on the frame structure signal 313.)

FIGS. 24A and 24B are an example of a mapping method over an IQ plane, having an in-phase component I and a quadrature-phase component Q, to form a baseband signal in QPSK modulation. For example, as shown in FIG. 24A, if the input data is “00”, the output is I=1.0, Q=1.0. Similarly, for input data of “01”, the output is I=−1.0, Q=1.0, and so forth. FIG. 24B is an example of a different method of mapping in an IQ plane for QPSK modulation than FIG. 24A. The difference between FIG. 24B and FIG. 24A is that the signal points in FIG. 24A have been rotated around the origin to yield the signal points of FIG. 24B. Non-Patent Literature 9 and Non-Patent Literature 10 describe such a rotated constellation method, and the Cyclic Q Delay described in Non-Patent Literature 9 and Non-Patent Literature 10 may also be adopted. As another example apart from FIGS. 24A and 24B, FIGS. 25A and 25B show signal point layout in the IQ plane for 16QAM. The example corresponding to FIG. 24A is shown in FIG. 25A, and the example corresponding to FIG. 24B is shown in FIG. 25B.

An encoder 302B receives information (data) 301B and the frame structure signal 313 as inputs and, in accordance with the frame structure signal 313, performs error correction coding such as convolutional coding, LDPC coding, turbo coding, or the like, outputting encoded data 303B. (The frame structure signal 313 includes information such as the error correction method used, the coding rate, the block length, and the like. The error correction method indicated by the frame structure signal 313 is used. Furthermore, the error correction method may be switched.)

An interleaver 304B receives the encoded data 303B and the frame structure signal 313 as inputs and performs interleaving, i.e. changing the order of the data, to output interleaved data 305B. (The method of interleaving may be switched based on the frame structure signal 313.)

A mapper 306B receives the interleaved data 305B and the frame structure signal 313 as inputs, performs modulation such as Quadrature Phase Shift Keying (QPSK), 16 Quadrature Amplitude Modulation (16QAM), 64 Quadrature Amplitude Modulation (64QAM), or the like, and outputs a resulting baseband signal 307B. (The method of modulation may be switched based on the frame structure signal 313.)

A weighting information generating unit 314 receives the frame structure signal 313 as an input and outputs information 315 regarding a weighting method based on the frame structure signal 313. The weighting method is characterized by regular hopping between weights.

A weighting unit 308A receives the baseband signal 307A, the baseband signal 307B, and the information 315 regarding the weighting method, and based on the information 315 regarding the weighting method, performs weighting on the baseband signal 307A and the baseband signal 307B and outputs a signal 309A resulting from the weighting. Details on the weighting method are provided later.

A wireless unit 310A receives the signal 309A resulting from the weighting as an input and performs processing such as quadrature modulation, band limiting, frequency conversion, amplification, and the like, outputting a transmission signal 311A. A transmission signal 311A is output as a radio wave from an antenna 312A.

A weighting unit 308B receives the baseband signal 307A, the baseband signal 307B, and the information 315 regarding the weighting method, and based on the information 315 regarding the weighting method, performs weighting on the baseband signal 307A and the baseband signal 307B and outputs a signal 309B resulting from the weighting.

FIG. 26 shows the structure of a weighting unit. The baseband signal 307A is multiplied by w11(t), yielding w11(t)s1(t), and is multiplied by w21(t), yielding w21(t)s1(t). Similarly, the baseband signal 307B is multiplied by w12(t) to generate w12(t)s2(t) and is multiplied by w22(t) to generate w22(t)s2(t). Next, z1(t)=w11(t)s1(t)+w12(t)s2(t) and z2(t)=w21(t)s1(t)+w22(t)s2(t) are obtained.

Details on the weighting method are provided later.

A wireless unit 310B receives the signal 309B resulting from the weighting as an input and performs processing such as quadrature modulation, band limiting, frequency conversion, amplification, and the like, outputting a transmission signal 311B. A transmission signal 311B is output as a radio wave from an antenna 312B.

FIG. 4 shows an example of the structure of a transmission device 400 that differs from FIG. 3. The differences in FIG. 4 from FIG. 3 are described.

An encoder 402 receives information (data) 401 and the frame structure signal 313 as inputs and, in accordance with the frame structure signal 313, performs error correction coding and outputs encoded data 403.

A distribution unit 404 receives the encoded data 403 as an input, distributes the data 403, and outputs data 405A and data 405B. Note that in FIG. 4, one encoder is shown, but the number of encoders is not limited in this way. The present invention may similarly be embodied when the number of encoders is m (where m is an integer greater than or equal to one) and the distribution unit divides encoded data generated by each encoder into two parts and outputs the divided data.

FIG. 5 shows an example of a frame structure in the time domain for a transmission device according to the present embodiment. A symbol 500_1 is a symbol for notifying the reception device of the transmission method. For example, the symbol 500_1 conveys information such as the error correction method used for transmitting data symbols, the coding rate, and the modulation method used for transmitting data symbols.

The symbol 501_1 is for estimating channel fluctuation for the modulated signal z1(t) (where t is time) transmitted by the transmission device. The symbol 502_1 is the data symbol transmitted as symbol number u (in the time domain) by the modulated signal z1(t), and the symbol 503_1 is the data symbol transmitted as symbol number u+1 by the modulated signal z1(t).

The symbol 501_2 is for estimating channel fluctuation for the modulated signal z2(t) (where t is time) transmitted by the transmission device. The symbol 502_2 is the data symbol transmitted as symbol number u by the modulated signal z2(t), and the symbol 503_2 is the data symbol transmitted as symbol number u+1 by the modulated signal z2(t).

The following describes the relationships between the modulated signals z1(t) and z2(t) transmitted by the transmission device and the received signals r1(t) and r2(t) received by the reception device.

In FIGS. 5, 504#1 and 504#2 indicate transmit antennas in the transmission device, and 505#1 and 505#2 indicate receive antennas in the reception device. The transmission device transmits the modulated signal z1(t) from transmit antenna 504#1 and transmits the modulated signal z2(t) from transmit antenna 504#2. In this case, the modulated signal z1(t) and the modulated signal z2(t) are assumed to occupy the same (a shared/common) frequency (bandwidth). Letting the channel fluctuation for the transmit antennas of the transmission device and the antennas of the reception device be h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t), the signal received by the receive antenna 505#1 of the reception device be r1(t), and the signal received by the receive antenna 505#2 of the reception device be r2(t), the following relationship holds.

Math 36

$\begin{matrix} {\begin{pmatrix} {r\; 1(t)} \\ {r\; 2(t)} \end{pmatrix} = {\begin{pmatrix} {h_{11}(t)} & {h_{12}(t)} \\ {h_{21}(t)} & {h_{22}(t)} \end{pmatrix}\begin{pmatrix} {z\; 1(t)} \\ {z\; 2(t)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 36} \end{matrix}$

FIG. 6 relates to the weighting method (precoding method) in the present embodiment. A weighting unit 600 integrates the weighting units 308A and 308B in FIG. 3. As shown in FIG. 6, a stream s1(t) and a stream s2(t) correspond to the baseband signals 307A and 307B in FIG. 3. In other words, the streams s1(t) and s2(t) are the baseband signal in-phase components I and quadrature-phase components Q when mapped according to a modulation scheme such as QPSK, 16QAM, 64QAM, or the like. As indicated by the frame structure of FIG. 6, the stream s1(t) is represented as s1(u) at symbol number u, as s1(u+1) at symbol number u+1, and so forth. Similarly, the stream s2(t) is represented as s2(u) at symbol number u, as s2(u+1) at symbol number u+1, and so forth. The weighting unit 600 receives the baseband signals 307A (s1(t)) and 307B (s2(t)) and the information 315 regarding weighting information in FIG. 3 as inputs, performs weighting in accordance with the information 315 regarding weighting, and outputs the signals 309A (z1(t)) and 309B (z2(t)) after weighting in FIG. 3. In this case, z1(t) and z2(t) are represented as follows.

For symbol number 4i (where i is an integer greater than or equal to zero):

Math 37

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {4\; i} \right)} \\ {z\; 2\left( {4i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\; 0} & e^{j\;\frac{3}{4}\pi} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {4i} \right)} \\ {s\; 2\left( {4i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 37} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 4i+1:

Math 38

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 1} \right)} \\ {z\; 2\left( {{4i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;\frac{3}{4}\pi} & e^{j\; 0} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4i} + 1} \right)} \\ {s\; 2\left( {{4i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 38} \end{matrix}$

For symbol number 4i+2:

Math 39

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 2} \right)} \\ {z\; 2\left( {{4i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\;\frac{3}{4}\pi} \\ e^{j\; 0} & e^{j\; 0} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4i} + 2} \right)} \\ {s\; 2\left( {{4i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 39} \end{matrix}$

For symbol number 4i+3:

Math 40

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 3} \right)} \\ {z\; 2\left( {{4i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;\frac{3}{4}\pi} & e^{j\; 0} \\ e^{j\; 0} & e^{j\; 0} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4i} + 3} \right)} \\ {s\; 2\left( {{4i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 40} \end{matrix}$

In this way, the weighting unit in FIG. 6 regularly hops between precoding weights over a four-slot period (cycle). (While precoding weights have been described as being hopped between regularly over four slots, the number of slots for regular hopping is not limited to four.)

Incidentally, Non-Patent Literature 4 describes switching the precoding weights for each slot. This switching of precoding weights is characterized by being random. On the other hand, in the present embodiment, a certain period (cycle) is provided, and the precoding weights are hopped between regularly. Furthermore, in each 2×2 precoding weight matrix composed of four precoding weights, the absolute value of each of the four precoding weights is equivalent to (1/sqrt(2)), and hopping is regularly performed between precoding weight matrices having this characteristic.

In an LOS environment, if a special precoding matrix is used, reception quality may greatly improve, yet the special precoding matrix differs depending on the conditions of direct waves. In an LOS environment, however, a certain tendency exists, and if precoding matrices are hopped between regularly in accordance with this tendency, the reception quality of data greatly improves. On the other hand, when precoding matrices are hopped between at random, a precoding matrix other than the above-described special precoding matrix may exist, and the possibility of performing precoding only with biased precoding matrices that are not suitable for the LOS environment also exists. Therefore, in an LOS environment, excellent reception quality may not always be obtained. Accordingly, there is a need for a precoding hopping method suitable for an LOS environment. The present invention proposes such a precoding method.

FIG. 7 is an example of the structure of a reception device 700 in the present embodiment. A wireless unit 703_X receives, as an input, a received signal 702_X received by an antenna 701_X, performs processing such as frequency conversion, quadrature demodulation, and the like, and outputs a baseband signal 704_X.

A channel fluctuation estimating unit 705_1 for the modulated signal z1 transmitted by the transmission device receives the baseband signal 704_X as an input, extracts a reference symbol 501_1 for channel estimation as in FIG. 5, estimates a value corresponding to h₁₁ in Equation 36, and outputs a channel estimation signal 706_1.

A channel fluctuation estimating unit 705_2 for the modulated signal z2 transmitted by the transmission device receives the baseband signal 704_X as an input, extracts a reference symbol 501_2 for channel estimation as in FIG. 5, estimates a value corresponding to h₁₂ in Equation 36, and outputs a channel estimation signal 706_2.

A wireless unit 703_Y receives, as input, a received signal 702_Y received by an antenna 701_Y, performs processing such as frequency conversion, quadrature demodulation, and the like, and outputs a baseband signal 704_Y.

A channel fluctuation estimating unit 707_1 for the modulated signal z1 transmitted by the transmission device receives the baseband signal 704_Y as an input, extracts a reference symbol 501_1 for channel estimation as in FIG. 5, estimates a value corresponding to h₂₁ in Equation 36, and outputs a channel estimation signal 708_1.

A channel fluctuation estimating unit 707_2 for the modulated signal z2 transmitted by the transmission device receives the baseband signal 704_Y as an input, extracts a reference symbol 501_2 for channel estimation as in FIG. 5, estimates a value corresponding to h₂₂ in Equation 36, and outputs a channel estimation signal 708_2.

A control information decoding unit 709 receives the baseband signal 704_X and the baseband signal 704_Y as inputs, detects the symbol 500_1 that indicates the transmission method as in FIG. 5, and outputs a signal 710 regarding information on the transmission method indicated by the transmission device.

A signal processing unit 711 receives, as inputs, the baseband signals 704_X and 704_Y, the channel estimation signals 706_1, 706_2, 708_1, and 708_2, and the signal 710 regarding information on the transmission method indicated by the transmission device, performs detection and decoding, and outputs received data 712_1 and 712_2.

Next, operations by the signal processing unit 711 in FIG. 7 are described in detail. FIG. 8 is an example of the structure of the signal processing unit 711 in the present embodiment. FIG. 8 shows an INNER MIMO detector, a soft-in/soft-out decoder, and a weighting coefficient generating unit as the main elements. Non-Patent Literature 2 and Non-Patent Literature 3 describe the method of iterative decoding with this structure. The MIMO system described in Non-Patent Literature 2 and Non-Patent Literature 3 is a spatial multiplexing MIMO system, whereas the present embodiment differs from Non-Patent Literature 2 and Non-Patent Literature 3 by describing a MIMO system that changes precoding weights with time. Letting the (channel) matrix in Equation 36 be H(t), the precoding weight matrix in FIG. 6 be W(t) (where the precoding weight matrix changes over t), the received vector be R(t)=(r1(t),r2(t)^(T), and the stream vector be S(t)=(s1(t),s2(t)^(T), the following Equation holds.

Math 41 R(t)=H(t)W(t)S(t)  Equation 41

In this case, the reception device can apply the decoding method in Non-Patent Literature 2 and Non-Patent Literature 3 to the received vector R(t) by considering H(t)W(t) as the channel matrix.

Therefore, a weighting coefficient generating unit 819 in FIG. 8 receives, as input, a signal 818 regarding information on the transmission method indicated by the transmission device (corresponding to 710 in FIG. 7) and outputs a signal 820 regarding information on weighting coefficients.

An INNER MIMO detector 803 receives the signal 820 regarding information on weighting coefficients as input and, using the signal 820, performs the calculation in Equation 41. Iterative detection and decoding is thus performed. The following describes operations thereof.

In the signal processing unit in FIG. 8, a processing method such as that shown in FIG. 10 is necessary for iterative decoding (iterative detection). First, one codeword (or one frame) of the modulated signal (stream) s1 and one codeword (or one frame) of the modulated signal (stream) s2 are decoded. As a result, the Log-Likelihood Ratio (LLR) of each bit of the one codeword (or one frame) of the modulated signal (stream) s1 and of the one codeword (or one frame) of the modulated signal (stream) s2 is obtained from the soft-in/soft-out decoder. Detection and decoding is performed again using the LLR. These operations are performed multiple times (these operations being referred to as iterative decoding (iterative detection)). Hereinafter, description focuses on the method of generating the log-likelihood ratio (LLR) of a symbol at a particular time in one frame.

In FIG. 8, a storage unit 815 receives, as inputs, a baseband signal 801X (corresponding to the baseband signal 704_X in FIG. 7), a channel estimation signal group 802X (corresponding to the channel estimation signals 706_1 and 706_2 in FIG. 7), a baseband signal 801Y (corresponding to the baseband signal 704_Y in FIG. 7), and a channel estimation signal group 802Y (corresponding to the channel estimation signals 708_1 and 708_2 in FIG. 7). In order to achieve iterative decoding (iterative detection), the storage unit 815 calculates H(t)W(t) in Equation 41 and stores the calculated matrix as a transformed channel signal group. The storage unit 815 outputs the above signals when necessary as a baseband signal 816X, a transformed channel estimation signal group 817X, a baseband signal 816Y, and a transformed channel estimation signal group 817Y.

Subsequent operations are described separately for initial detection and for iterative decoding (iterative detection).

<Initial Detection>

The INNER MIMO detector 803 receives, as inputs, the baseband signal 801X, the channel estimation signal group 802X, the baseband signal 801Y, and the channel estimation signal group 802Y. Here, the modulation method for the modulated signal (stream) s1 and the modulated signal (stream) s2 is described as 16QAM.

The INNER MIMO detector 803 first calculates H(t)W(t) from the channel estimation signal group 802X and the channel estimation signal group 802Y to seek candidate signal points corresponding to the baseband signal 801X. FIG. 11 shows such calculation. In FIG. 11, each black dot (●) is a candidate signal point in the IQ plane. Since the modulation method is 16QAM, there are 256 candidate signal points. (Since FIG. 11 is only for illustration, not all 256 candidate signal points are shown.) Here, letting the four bits transferred by modulated signal s1 be b0, b1, b2, and b3, and the four bits transferred by modulated signal s2 be b4, b5, b6, and b7, candidate signal points corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) in FIG. 11 exist. The squared Euclidian distance is sought between a received signal point 1101 (corresponding to the baseband signal 801X) and each candidate signal point. Each squared Euclidian distance is divided by the noise variance σ². Accordingly, E_(X)(b0, b1, b2, b3, b4, b5, b6, b7), i.e. the value of the squared Euclidian distance between a candidate signal point corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) and a received signal point, divided by the noise variance, is sought. Note that the baseband signals and the modulated signals s1 and s2 are each complex signals.

Similarly, H(t)W(t) is calculated from the channel estimation signal group 802X and the channel estimation signal group 802Y, candidate signal points corresponding to the baseband signal 801Y are sought, the squared Euclidian distance for the received signal point (corresponding to the baseband signal 801Y) is sought, and the squared Euclidian distance is divided by the noise variance σ². Accordingly, E_(Y)(b0, b1, b2, b3, b4, b5, b6, b7), i.e. the value of the squared Euclidian distance between a candidate signal point corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) and a received signal point, divided by the noise variance, is sought.

Then E_(X)(b0, b1, b2, b3, b4, b5, b6, b7)+E_(Y)(b0, b1, b2, b3, b4, b5, b6, b7)=E(b0, b1, b2, b3, b4, b5, b6, b7) is sought.

The INNER MIMO detector 803 outputs E(b0, b1, b2, b3, b4, b5, b6, b7) as a signal 804.

A log-likelihood calculating unit 805A receives the signal 804 as input, calculates the log likelihood for bits b0, b1, b2, and b3, and outputs a log-likelihood signal 806A. Note that during calculation of the log likelihood, the log likelihood for “1” and the log likelihood for “0” are calculated. The calculation method is as shown in Equations 28, 29, and 30. Details can be found in Non-Patent Literature 2 and Non-Patent Literature 3.

Similarly, a log-likelihood calculating unit 805B receives the signal 804 as input, calculates the log likelihood for bits b4, b5, b6, and b7, and outputs a log-likelihood signal 806B.

A deinterleaver (807A) receives the log-likelihood signal 806A as an input, performs deinterleaving corresponding to the interleaver (the interleaver (304A) in FIG. 3), and outputs a deinterleaved log-likelihood signal 808A.

Similarly, a deinterleaver (807B) receives the log-likelihood signal 806B as an input, performs deinterleaving corresponding to the interleaver (the interleaver (304B) in FIG. 3), and outputs a deinterleaved log-likelihood signal 808B.

A log-likelihood ratio calculating unit 809A receives the interleaved log-likelihood signal 808A as an input, calculates the log-likelihood ratio (LLR) of the bits encoded by the encoder 302A in FIG. 3, and outputs a log-likelihood ratio signal 810A.

Similarly, a log-likelihood ratio calculating unit 809B receives the interleaved log-likelihood signal 808B as an input, calculates the log-likelihood ratio (LLR) of the bits encoded by the encoder 302B in FIG. 3, and outputs a log-likelihood ratio signal 810B.

A soft-in/soft-out decoder 811A receives the log-likelihood ratio signal 810A as an input, performs decoding, and outputs a decoded log-likelihood ratio 812A.

Similarly, a soft-in/soft-out decoder 811B receives the log-likelihood ratio signal 810B as an input, performs decoding, and outputs a decoded log-likelihood ratio 812B.

<Iterative Decoding (Iterative Detection), Number of Iterations k>

An interleaver (813A) receives the log-likelihood ratio 812A decoded by the soft-in/soft-out decoder in the (k−1)^(th) iteration as an input, performs interleaving, and outputs an interleaved log-likelihood ratio 814A. The interleaving pattern in the interleaver (813A) is similar to the interleaving pattern in the interleaver (304A) in FIG. 3.

An interleaver (813B) receives the log-likelihood ratio 812B decoded by the soft-in/soft-out decoder in the (k−1)^(th) iteration as an input, performs interleaving, and outputs an interleaved log-likelihood ratio 814B. The interleaving pattern in the interleaver (813B) is similar to the interleaving pattern in the interleaver (304B) in FIG. 3.

The INNER MIMO detector 803 receives, as inputs, the baseband signal 816X, the transformed channel estimation signal group 817X, the baseband signal 816Y, the transformed channel estimation signal group 817Y, the interleaved log-likelihood ratio 814A, and the interleaved log-likelihood ratio 814B. The reason for using the baseband signal 816X, the transformed channel estimation signal group 817X, the baseband signal 816Y, and the transformed channel estimation signal group 817Y instead of the baseband signal 801X, the channel estimation signal group 802X, the baseband signal 801Y, and the channel estimation signal group 802Y is because a delay occurs due to iterative decoding.

The difference between operations by the INNER MIMO detector 803 for iterative decoding and for initial detection is the use of the interleaved log-likelihood ratio 814A and the interleaved log-likelihood ratio 814B during signal processing. The INNER MIMO detector 803 first seeks E(b0, b1, b2, b3, b4, b5, b6, b7), as during initial detection. Additionally, coefficients corresponding to Equations 11 and 32 are sought from the interleaved log-likelihood ratio 814A and the interleaved log-likelihood ratio 914B. The value E(b0, b1, b2, b3, b4, b5, b6, b7) is adjusted using the sought coefficients, and the resulting value E′(b0, b1, b2, b3, b4, b5, b6, b7) is output as the signal 804.

The log-likelihood calculating unit 805A receives the signal 804 as input, calculates the log likelihood for bits b0, b1, b2, and b3, and outputs the log-likelihood signal 806A. Note that during calculation of the log likelihood, the log likelihood for “1” and the log likelihood for “0” are calculated. The calculation method is as shown in Equations 31, 32, 33, 34, and 35. Details can be found in Non-Patent Literature 2 and Non-Patent Literature 3.

Similarly, the log-likelihood calculating unit 805B receives the signal 804 as input, calculates the log likelihood for bits b4, b5, b6, and b7, and outputs the log-likelihood signal 806B. Operations by the deinterleaver onwards are similar to initial detection.

Note that while FIG. 8 shows the structure of the signal processing unit when performing iterative detection, iterative detection is not always essential for obtaining excellent reception quality, and a structure not including the interleavers 813A and 813B, which are necessary only for iterative detection, is possible. In such a case, the INNER MIMO detector 803 does not perform iterative detection.

The main part of the present embodiment is calculation of H(t)W(t). Note that as shown in Non-Patent Literature 5 and the like, QR decomposition may be used to perform initial detection and iterative detection.

Furthermore, as shown in Non-Patent Literature 11, based on H(t)W(t), linear operation of the Minimum Mean Squared Error (MMSE) and Zero Forcing (ZF) may be performed in order to perform initial detection.

FIG. 9 is the structure of a different signal processing unit than FIG. 8 and is for the modulated signal transmitted by the transmission device in FIG. 4. The difference with FIG. 8 is the number of soft-in/soft-out decoders. A soft-in/soft-out decoder 901 receives, as inputs, the log-likelihood ratio signals 810A and 810B, performs decoding, and outputs a decoded log-likelihood ratio 902. A distribution unit 903 receives the decoded log-likelihood ratio 902 as an input and distributes the log-likelihood ratio 902. Other operations are similar to FIG. 8.

FIGS. 12A and 12B show BER characteristics for a transmission method using the precoding weights of the present embodiment under similar conditions to FIGS. 29A and 29B. FIG. 12A shows the BER characteristics of Max-log A Posteriori Probability (APP) without iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2), and FIG. 12B shows the BER characteristics of Max-log-APP with iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2) (number of iterations: five). Comparing FIGS. 12A, 12B, 29A, and 29B shows how if the transmission method of the present embodiment is used, the BER characteristics when the Rician factor is large greatly improve over the BER characteristics when using spatial multiplexing MIMO, thereby confirming the usefulness of the method in the present embodiment.

As described above, when a transmission device transmits a plurality of modulated signals from a plurality of antennas in a MIMO system, the advantageous effect of improved transmission quality, as compared to conventional spatial multiplexing MIMO, is achieved in an LOS environment in which direct waves dominate by hopping between precoding weights regularly over time, as in the present embodiment.

In the present embodiment, and in particular with regards to the structure of the reception device, operations have been described for a limited number of antennas, but the present invention may be embodied in the same way even if the number of antennas increases. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present embodiment. Furthermore, in the present embodiment, the example of LDPC coding has particularly been explained, but the present invention is not limited to LDPC coding. Furthermore, with regards to the decoding method, the soft-in/soft-out decoders are not limited to the example of sum-product decoding. Another soft-in/soft-out decoding method may be used, such as a BCJR algorithm, a SOVA algorithm, a Max-log-MAP algorithm, and the like. Details are provided in Non-Patent Literature 6.

Additionally, in the present embodiment, the example of a single carrier method has been described, but the present invention is not limited in this way and may be similarly embodied for multi-carrier transmission. Accordingly, when using a method such as spread spectrum communication, Orthogonal Frequency-Division Multiplexing (OFDM), Single Carrier Frequency Division Multiple Access (SC-FDMA), Single Carrier Orthogonal Frequency-Division Multiplexing (SC-OFDM), or wavelet OFDM as described in Non-Patent Literature 7 and the like, for example, the present invention may be similarly embodied. Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, and the like), symbols for transmission of control information, and the like, may be arranged in the frame in any way.

The following describes an example of using OFDM as an example of a multi-carrier method.

FIG. 13 shows the structure of a transmission device when using OFDM. In FIG. 13, elements that operate in a similar way to FIG. 3 bear the same reference signs.

An OFDM related processor 1301A receives, as input, the weighted signal 309A, performs processing related to OFDM, and outputs a transmission signal 1302A. Similarly, an OFDM related processor 1301B receives, as input, the weighted signal 309B, performs processing related to OFDM, and outputs a transmission signal 1302B.

FIG. 14 shows an example of a structure from the OFDM related processors 1301A and 1301B in FIG. 13 onwards. The part from 1401A to 1410A is related to the part from 1301A to 312A in FIG. 13, and the part from 1401B to 1410B is related to the part from 1301B to 312B in FIG. 13.

A serial/parallel converter 1402A performs serial/parallel conversion on a weighted signal 1401A (corresponding to the weighted signal 309A in FIG. 13) and outputs a parallel signal 1403A.

A reordering unit 1404A receives a parallel signal 1403A as input, performs reordering, and outputs a reordered signal 1405A. Reordering is described in detail later.

An inverse fast Fourier transformer 1406A receives the reordered signal 1405A as an input, performs a fast Fourier transform, and outputs a fast Fourier transformed signal 1407A.

A wireless unit 1408A receives the fast Fourier transformed signal 1407A as an input, performs processing such as frequency conversion, amplification, and the like, and outputs a modulated signal 1409A. The modulated signal 1409A is output as a radio wave from an antenna 1410A.

A serial/parallel converter 1402B performs serial/parallel conversion on a weighted signal 1401B (corresponding to the weighted signal 309B in FIG. 13) and outputs a parallel signal 1403B.

A reordering unit 1404B receives a parallel signal 1403B as input, performs reordering, and outputs a reordered signal 1405B. Reordering is described in detail later.

An inverse fast Fourier transformer 1406B receives the reordered signal 1405B as an input, performs a fast Fourier transform, and outputs a fast Fourier transformed signal 1407B.

A wireless unit 1408B receives the fast Fourier transformed signal 1407B as an input, performs processing such as frequency conversion, amplification, and the like, and outputs a modulated signal 1409B. The modulated signal 1409B is output as a radio wave from an antenna 1410B.

In the transmission device of FIG. 3, since the transmission method does not use multi-carrier, precoding hops to form a four-slot period (cycle), as shown in FIG. 6, and the precoded symbols are arranged in the time domain. When using a multi-carrier transmission method as in the OFDM method shown in FIG. 13, it is of course possible to arrange the precoded symbols in the time domain as in FIG. 3 for each (sub)carrier. In the case of a multi-carrier transmission method, however, it is possible to arrange symbols in the frequency domain, or in both the frequency and time domains. The following describes these arrangements.

FIGS. 15A and 15B show an example of a method of reordering symbols by reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time. The frequency domain runs from (sub)carrier 0 through (sub)carrier 9. The modulated signals z1 and z2 use the same frequency bandwidth at the same time. FIG. 15A shows the reordering method for symbols of the modulated signal z1, and FIG. 15B shows the reordering method for symbols of the modulated signal z2. Numbers #1, #2, #3, #4, . . . are assigned to in order to the symbols of the weighted signal 1401A which is input into the serial/parallel converter 1402A. At this point, symbols are assigned regularly, as shown in FIG. 15A. The symbols #1, #2, #3, #4, . . . are arranged in order starting from carrier 0. The symbols #1 through #9 are assigned to time $1, and subsequently, the symbols #10 through #19 are assigned to time $2.

Similarly, numbers #1, #2, #3, #4, . . . are assigned in order to the symbols of the weighted signal 1401B which is input into the serial/parallel converter 1402B. At this point, symbols are assigned regularly, as shown in FIG. 15B. The symbols #1, #2, #3, #4, . . . are arranged in order starting from carrier 0. The symbols #1 through #9 are assigned to time $1, and subsequently, the symbols #10 through #19 are assigned to time $2. Note that the modulated signals z1 and z2 are complex signals.

The symbol group 1501 and the symbol group 1502 shown in FIGS. 15A and 15B are the symbols for one period (cycle) when using the precoding weight hopping method shown in FIG. 6. Symbol #0 is the symbol when using the precoding weight of slot 4i in FIG. 6. Symbol #1 is the symbol when using the precoding weight of slot 4i+1 in FIG. 6. Symbol #2 is the symbol when using the precoding weight of slot 4i+2 in FIG. 6. Symbol #3 is the symbol when using the precoding weight of slot 4i+3 in FIG. 6. Accordingly, symbol #x is as follows. When x mod 4 is 0, the symbol #x is the symbol when using the precoding weight of slot 4i in FIG. 6. When x mod 4 is 1, the symbol #x is the symbol when using the precoding weight of slot 4i+1 in FIG. 6. When x mod 4 is 2, the symbol #x is the symbol when using the precoding weight of slot 4i+2 in FIG. 6. When x mod 4 is 3, the symbol #x is the symbol when using the precoding weight of slot 4i+3 in FIG. 6.

In this way, when using a multi-carrier transmission method such as OFDM, unlike during single carrier transmission, symbols can be arranged in the frequency domain. Furthermore, the ordering of symbols is not limited to the ordering shown in FIGS. 15A and 15B. Other examples are described with reference to FIGS. 16A, 16B, 17A, and 17B.

FIGS. 16A and 16B show an example of a method of reordering symbols by the reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time, that differs from FIGS. 15A and 15B. FIG. 16A shows the reordering method for symbols of the modulated signal z1, and FIG. 16B shows the reordering method for symbols of the modulated signal z2. The difference in FIGS. 16A and 16B as compared to FIGS. 15A and 15B is that the reordering method of the symbols of the modulated signal z1 differs from the reordering method of the symbols of the modulated signal z2. In FIG. 16B, symbols #0 through #5 are assigned to carriers 4 through 9, and symbols #6 through #9 are assigned to carriers 0 through 3. Subsequently, symbols #10 through #19 are assigned regularly in the same way. At this point, as in FIGS. 15A and 15B, the symbol group 1601 and the symbol group 1602 shown in FIGS. 16A and 16B are the symbols for one period (cycle) when using the precoding weight hopping method shown in FIG. 6.

FIGS. 17A and 17B show an example of a method of reordering symbols by the reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time, that differs from FIGS. 15A and 15B. FIG. 17A shows the reordering method for symbols of the modulated signal z1, and FIG. 17B shows the reordering method for symbols of the modulated signal z2. The difference in FIGS. 17A and 17B as compared to FIGS. 15A and 15B is that whereas the symbols are arranged in order by carrier in FIGS. 15A and 15B, the symbols are not arranged in order by carrier in FIGS. 17A and 17B. It is obvious that, in FIGS. 17A and 17B, the reordering method of the symbols of the modulated signal z1 may differ from the reordering method of the symbols of the modulated signal z2, as in FIGS. 16A and 16B.

FIGS. 18A and 18B show an example of a method of reordering symbols by the reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time, that differs from FIGS. 15A through 17B. FIG. 18A shows the reordering method for symbols of the modulated signal z1, and FIG. 18B shows the reordering method for symbols of the modulated signal z2. In FIGS. 15A through 17B, symbols are arranged in the frequency domain, whereas in FIGS. 18A and 18B, symbols are arranged in both the frequency and time domains.

In FIG. 6, an example has been described of hopping between precoding weights over four slots. Here, however, an example of hopping over eight slots is described. The symbol groups 1801 and 1802 shown in FIGS. 18A and 18B are the symbols for one period (cycle) when using the precoding weight hopping method (and are therefore eight-symbol groups). Symbol #0 is the symbol when using the precoding weight of slot 8i. Symbol #1 is the symbol when using the precoding weight of slot 8i+1. Symbol #2 is the symbol when using the precoding weight of slot 8i+2. Symbol #3 is the symbol when using the precoding weight of slot 8i+3. Symbol #4 is the symbol when using the precoding weight of slot 8i+4. Symbol #5 is the symbol when using the precoding weight of slot 8i+5. Symbol #6 is the symbol when using the precoding weight of slot 8i+6. Symbol #7 is the symbol when using the precoding weight of slot 8i+7. Accordingly, symbol #x is as follows. When x mod 8 is 0, the symbol #x is the symbol when using the precoding weight of slot 8i. When x mod 8 is 1, the symbol #x is the symbol when using the precoding weight of slot 8i+1. When x mod 8 is 2, the symbol #x is the symbol when using the precoding weight of slot 8i+2. When x mod 8 is 3, the symbol #x is the symbol when using the precoding weight of slot 8i+3. When x mod 8 is 4, the symbol #x is the symbol when using the precoding weight of slot 8i+4. When x mod 8 is 5, the symbol #x is the symbol when using the precoding weight of slot 8i+5. When x mod 8 is 6, the symbol #x is the symbol when using the precoding weight of slot 8i+6. When x mod 8 is 7, the symbol #x is the symbol when using the precoding weight of slot 8i+7. In the symbol ordering in FIGS. 18A and 18B, four slots in the time domain and two slots in the frequency domain for a total of 4 x 2=8 slots are used to arrange symbols for one period (cycle). In this case, letting the number of symbols in one period (cycle) be m×n symbols (in other words, m×n precoding weights exist), the number of slots (the number of carriers) in the frequency domain used to arrange symbols in one period (cycle) be n, and the number of slots used in the time domain be m, m should be greater than n. This is because the phase of direct waves fluctuates more slowly in the time domain than in the frequency domain. Therefore, since the precoding weights are changed in the present embodiment to minimize the influence of steady direct waves, it is preferable to reduce the fluctuation in direct waves in the period (cycle) for changing the precoding weights. Accordingly, m should be greater than n. Furthermore, considering the above points, rather than reordering symbols only in the frequency domain or only in the time domain, direct waves are more likely to become stable when symbols are reordered in both the frequency and the time domains as in FIGS. 18A and 18B, thereby making it easier to achieve the advantageous effects of the present invention. When symbols are ordered in the frequency domain, however, fluctuations in the frequency domain are abrupt, leading to the possibility of yielding diversity gain. Therefore, reordering in both the frequency and the time domains is not necessarily always the best method.

FIGS. 19A and 19B show an example of a method of reordering symbols by the reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time, that differs from FIGS. 18A and 18B. FIG. 19A shows the reordering method for symbols of the modulated signal z1, and FIG. 19B shows the reordering method for symbols of the modulated signal z2. As in FIGS. 18A and 18B, FIGS. 19A and 19B show arrangement of symbols using both the frequency and the time axes. The difference as compared to FIGS. 18A and 18B is that, whereas symbols are arranged first in the frequency domain and then in the time domain in FIGS. 18A and 18B, symbols are arranged first in the time domain and then in the frequency domain in FIGS. 19A and 19B. In FIGS. 19A and 19B, the symbol group 1901 and the symbol group 1902 are the symbols for one period (cycle) when using the precoding hopping method.

Note that in FIGS. 18A, 18B, 19A, and 19B, as in FIGS. 16A and 16B, the present invention may be similarly embodied, and the advantageous effect of high reception quality achieved, with the symbol arranging method of the modulated signal z1 differing from the symbol arranging method of the modulated signal z2. Furthermore, in FIGS. 18A, 18B, 19A, and 19B, as in FIGS. 17A and 17B, the present invention may be similarly embodied, and the advantageous effect of high reception quality achieved, without arranging the symbols in order.

FIG. 27 shows an example of a method of reordering symbols by the reordering units 1404A and 1404B in FIG. 14, the horizontal axis representing frequency, and the vertical axis representing time, that differs from the above examples. The case of hopping between precoding matrix regularly over four slots, as in Equations 37-40, is considered. The characteristic feature of FIG. 27 is that symbols are arranged in order in the frequency domain, but when progressing in the time domain, symbols are cyclically shifted by n symbols (in the example in FIG. 27, n=1). In the four symbols shown in the symbol group 2710 in the frequency domain in FIG. 27, precoding hops between the precoding matrices of Equations 37-40.

In this case, symbol #0 is precoded using the precoding matrix in Equation 37, symbol #1 is precoded using the precoding matrix in Equation 38, symbol #2 is precoded using the precoding matrix in Equation 39, and symbol #3 is precoded using the precoding matrix in Equation 40.

Similarly, for the symbol group 2720 in the frequency domain, symbol #4 is precoded using the precoding matrix in Equation 37, symbol #5 is precoded using the precoding matrix in Equation 38, symbol #6 is precoded using the precoding matrix in Equation 39, and symbol #7 is precoded using the precoding matrix in Equation 40.

For the symbols at time $1, precoding hops between the above precoding matrices, but in the time domain, symbols are cyclically shifted. Therefore, precoding hops between precoding matrices for the symbol groups 2701, 2702, 2703, and 2704 as follows.

In the symbol group 2701 in the time domain, symbol #0 is precoded using the precoding matrix in Equation 37, symbol #9 is precoded using the precoding matrix in Equation 38, symbol #18 is precoded using the precoding matrix in Equation 39, and symbol #27 is precoded using the precoding matrix in Equation 40.

In the symbol group 2702 in the time domain, symbol #28 is precoded using the precoding matrix in Equation 37, symbol #1 is precoded using the precoding matrix in Equation 38, symbol #10 is precoded using the precoding matrix in Equation 39, and symbol #19 is precoded using the precoding matrix in Equation 40.

In the symbol group 2703 in the time domain, symbol #20 is precoded using the precoding matrix in Equation 37, symbol #29 is precoded using the precoding matrix in Equation 38, symbol #2 is precoded using the precoding matrix in Equation 39, and symbol #11 is precoded using the precoding matrix in Equation 40.

In the symbol group 2704 in the time domain, symbol #12 is precoded using the precoding matrix in Equation 37, symbol #21 is precoded using the precoding matrix in Equation 38, symbol #30 is precoded using the precoding matrix in Equation 39, and symbol #3 is precoded using the precoding matrix in Equation 40.

The characteristic of FIG. 27 is that, for example focusing on symbol #11, the symbols on either side in the frequency domain at the same time (symbols #10 and #12) are both precoded with a different precoding matrix than symbol #11, and the symbols on either side in the time domain in the same carrier (symbols #2 and #20) are both precoded with a different precoding matrix than symbol #11. This is true not only for symbol #11. Any symbol having symbols on either side in the frequency domain and the time domain is characterized in the same way as symbol #11. As a result, precoding matrices are effectively hopped between, and since the influence on stable conditions of direct waves is reduced, the possibility of improved reception quality of data increases.

In FIG. 27, the case of n=1 has been described, but n is not limited in this way. The present invention may be similarly embodied with n=3. Furthermore, in FIG. 27, when symbols are arranged in the frequency domain and time progresses in the time domain, the above characteristic is achieved by cyclically shifting the number of the arranged symbol, but the above characteristic may also be achieved by randomly (or regularly) arranging the symbols.

Embodiment 2

In Embodiment 1, regular hopping of the precoding weights as shown in FIG. 6 has been described. In the present embodiment, a method for designing specific precoding weights that differ from the precoding weights in FIG. 6 is described.

In FIG. 6, the method for hopping between the precoding weights in Equations 37-40 has been described. By generalizing this method, the precoding weights may be changed as follows. (The hopping period (cycle) for the precoding weights has four slots, and Equations are listed similarly to Equations 37-40.)

For symbol number 4i (where i is an integer greater than or equal to zero):

Math 42

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {4\; i} \right)} \\ {z\; 2\left( {4i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({4i})}}} & e^{j{({{\theta_{11}{({4i})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({4i})}}} & e^{j{({{\theta_{21}{({4i})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {4i} \right)} \\ {s\; 2\left( {4i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 42} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 4i+1:

Math 43

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 1} \right)} \\ {z\; 2\left( {{4i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{4i} + 1})}}} & e^{j{({{\theta_{11}{({{4i} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4i} + 1})}}} & e^{j{({{\theta_{21}{({{4i} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4i} + 1} \right)} \\ {s\; 2\left( {{4i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 43} \end{matrix}$

For symbol number 4i+2:

Math 44

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 2} \right)} \\ {z\; 2\left( {{4i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{4i} + 2})}}} & e^{j{({{\theta_{11}{({{4i} + 2})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4i} + 2})}}} & e^{j{({{\theta_{21}{({{4i} + 2})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4i} + 2} \right)} \\ {s\; 2\left( {{4i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 44} \end{matrix}$

For symbol number 4i+3:

Math 45

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{4\; i} + 3} \right)} \\ {z\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 3})}}} & e^{j{({{\theta_{11}{({{4\; i} + 3})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 3})}}} & e^{j{({{\theta_{21}{({{4\; i} + 3})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 3} \right)} \\ {s\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 45} \end{matrix}$

From Equations 36 and 41, the received vector R(t)=(r1(t), r2(t))^(T) can be represented as follows.

For symbol number 4i:

Math 46

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {4\; i} \right)} \\ {r\; 2\left( {4\; i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {4i} \right)} & {h_{12}\left( {4i} \right)} \\ {h_{21}\left( {4i} \right)} & {h_{22}\left( {4i} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({4\; i})}}} & e^{j{({{\theta_{11}{({4\; i})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({4\; i})}}} & e^{j{({{\theta_{21}{({4\; i})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {4\; i} \right)} \\ {s\; 2\left( {4\; i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 46} \end{matrix}$

For symbol number 4i+1:

Math 47

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 1} \right)} \\ {r\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{4i} + 1} \right)} & {h_{12}\left( {{4i} + 1} \right)} \\ {h_{21}\left( {{4i} + 1} \right)} & {h_{22}\left( {{4i} + 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 1})}}} & e^{j{({{\theta_{11}{({{4\; i} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 1})}}} & e^{j{({{\theta_{21}{({{4\; i} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 1} \right)} \\ {s\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 47} \end{matrix}$

For symbol number 4i+2:

Math 48

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 2} \right)} \\ {r\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{4i} + 2} \right)} & {h_{12}\left( {{4i} + 2} \right)} \\ {h_{21}\left( {{4i} + 2} \right)} & {h_{22}\left( {{4i} + 2} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 2})}}} & e^{j{({{\theta_{11}{({{4\; i} + 2})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 2})}}} & e^{j{({{\theta_{21}{({{4\; i} + 2})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 2} \right)} \\ {s\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 48} \end{matrix}$

For symbol number 4i+3:

Math 49

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 3} \right)} \\ {r\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{4i} + 3} \right)} & {h_{12}\left( {{4i} + 3} \right)} \\ {h_{21}\left( {{4i} + 3} \right)} & {h_{22}\left( {{4i} + 3} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 3})}}} & e^{j{({{\theta_{11}{({{4\; i} + 3})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 3})}}} & e^{j{({{\theta_{21}{({{4\; i} + 3})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 3} \right)} \\ {s\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 49} \end{matrix}$

In this case, it is assumed that only components of direct waves exist in the channel elements h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t), that the amplitude components of the direct waves are all equal, and that fluctuations do not occur over time. With these assumptions, Equations 46-49 can be represented as follows.

For symbol number 4i:

Math 50

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {4\; i} \right)} \\ {r\; 2\left( {4\; i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({4\; i})}}} & e^{j{({{\theta_{11}{({4\; i})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({4\; i})}}} & e^{j{({{\theta_{21}{({4\; i})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {4\; i} \right)} \\ {s\; 2\left( {4\; i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 50} \end{matrix}$

For symbol number 4i+1:

Math 51

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 1} \right)} \\ {r\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 1})}}} & e^{j{({{\theta_{11}{({{4\; i} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 1})}}} & e^{j{({{\theta_{21}{({{4\; i} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 1} \right)} \\ {s\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 51} \end{matrix}$

For symbol number 4i+2:

Math 52

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 2} \right)} \\ {r\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 2})}}} & e^{j{({{\theta_{11}{({{4\; i} + 2})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 2})}}} & e^{j{({{\theta_{21}{({{4\; i} + 2})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 2} \right)} \\ {s\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 52} \end{matrix}$

For symbol number 4i+3:

Math 53

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 3} \right)} \\ {r\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 3})}}} & e^{j{({{\theta_{11}{({{4\; i} + 3})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 3})}}} & e^{j{({{\theta_{21}{({{4\; i} + 3})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 3} \right)} \\ {s\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 53} \end{matrix}$

In Equations 50-53, let A be a positive real number and q be a complex number. The values of A and q are determined in accordance with the positional relationship between the transmission device and the reception device. Equations 50-53 can be represented as follows.

For symbol number 4i:

Math 54

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {4\; i} \right)} \\ {r\; 2\left( {4\; i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({4\; i})}}} & e^{j{({{\theta_{11}{({4\; i})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({4\; i})}}} & e^{j{({{\theta_{21}{({4\; i})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {4\; i} \right)} \\ {s\; 2\left( {4\; i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 54} \end{matrix}$

For symbol number 4i+1:

Math 55

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 1} \right)} \\ {r\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 1})}}} & e^{j{({{\theta_{11}{({{4\; i} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 1})}}} & e^{j{({{\theta_{21}{({{4\; i} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 1} \right)} \\ {s\; 2\left( {{4\; i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 55} \end{matrix}$

For symbol number 4i+2:

Math 56

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 2} \right)} \\ {r\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 2})}}} & e^{j{({{\theta_{11}{({{4\; i} + 2})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 2})}}} & e^{j{({{\theta_{21}{({{4\; i} + 2})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 2} \right)} \\ {s\; 2\left( {{4\; i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 56} \end{matrix}$

For symbol number 4i+3:

Math 57

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{4\; i} + 3} \right)} \\ {r\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{4\; i} + 3})}}} & e^{j{({{\theta_{11}{({{4\; i} + 3})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{4\; i} + 3})}}} & e^{j{({{\theta_{21}{({{4\; i} + 3})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{4\; i} + 3} \right)} \\ {s\; 2\left( {{4\; i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 57} \end{matrix}$

As a result, when q is represented as follows, a signal component based on one of s1 and s2 is no longer included in r1 and r2, and therefore one of the signals s1 and s2 can no longer be obtained.

For symbol number 4i:

Math 58 q=A _(e) ^(j(θ) ¹¹ ^((4i)−θ) ²¹ ^((4i))) ,−A _(e) ^(j(θ) ¹¹ ^((4i)−θ) ²¹ ^((4i)−δ))  Equation 58

For symbol number 4i+1:

Math 59 q=−A _(e) ^(j(θ) ¹¹ ^((4i+1)−θ) ²¹ ^((4i+1))) ,−A _(e) ^(j(θ) ¹¹ ^((4i+1)−θ) ²¹ ^((4i+1)−δ))  Equation 59

For symbol number 4i+2:

Math 60 q=−A _(e) ^(j(θ) ¹¹ ^((4i+2)−θ) ²¹ ^((4i+2))) ,−A _(e) ^(j(θ) ¹¹ ^((4i+2)−θ) ²¹ ^((4i+2)−δ))  Equation 60

For symbol number 4i+3:

Math 61 q=−A _(e) ^(j(θ) ¹¹ ^((4i+3)−θ) ²¹ ^((4i+3))) ,−A _(e) ^(j(θ) ¹¹ ^((4i+3)−θ) ²¹ ^((4i+3)−δ))  Equation 61

In this case, if q has the same solution in symbol numbers 4i, 4i+1, 4i+2, and 4i+3, then the channel elements of the direct waves do not greatly fluctuate. Therefore, a reception device having channel elements in which the value of q is equivalent to the same solution can no longer obtain excellent reception quality for any of the symbol numbers. Therefore, it is difficult to achieve the ability to correct errors, even if error correction codes are introduced. Accordingly, for q not to have the same solution, the following condition is necessary from Equations 58-61 when focusing on one of two solutions of q which does not include δ.

Math 62

Condition #1 e ^(j(θ) ¹¹ ^((4i+x)−θ) ²¹ ^((4i+x))) ≠e ^(j(θ) ¹¹ ^((4i+y)−θ) ²¹ ^((4i+y))) for ∀x,∀y(x≠y;x,y=0,1,2,3)

(x is 0, 1, 2, 3; y is 0, 1, 2, 3; and x≠y.)

In an example fulfilling Condition #1, values are set as follows:

(Example #1)

(1) θ₁₁(4i)=θ₁₁(4i+1)=θ₁₁(4i+2)=θ₁₁(4i+3)=0 radians,

(2) θ₂₁(4i)=0 radians,

(3) θ₂₁(4i+1)=π/2 radians,

(4) θ₂₁(4i+2)=π radians, and

(5) θ₂₁(4i+3)=3π/2 radians.

(The above is an example. It suffices for one each of zero radians, π/2 radians, π radians, and 3π/2 radians to exist for the set (θ₂₁(4i), θ₂₁(4i+1), θ₂₁(4i+2), θ₂₁(4i+3)).) In this case, in particular under condition (1), there is no need to perform signal processing (rotation processing) on the baseband signal S1(t), which therefore offers the advantage of a reduction in circuit size. Another example is to set values as follows. (Example #2) (6) θ₁₁(4i)=0 radians, (7) θ₁₁(4i+1)=π/2 radians, (8) θ₁₁(4i+2)=π radians, (9) θ₁₁(4i+3)=3π/2 radians, and (10) θ₂₁(4i)=θ₂₁(4i+1)=θ₂₁(4i+2)=θ₂₁(4i+3)=0 radians. (The above is an example. It suffices for one each of zero radians, π/2 radians, π radians, and 3π/2 radians to exist for the set (θ₁₁(4i), θ₁₁(4i+1), θ₁₁(4i+2), θ₁₁(4i+3)).) In this case, in particular under condition (6), there is no need to perform signal processing (rotation processing) on the baseband signal S2(t), which therefore offers the advantage of a reduction in circuit size. Yet another example is as follows. (Example #3) (11) θ₁₁(4i)=θ₁₁(4i+1)=θ₁₁(4i+2)=θ₁₁(4i+3)=0 radians, (12) θ₂₁(4i)=0 radians, (13) θ₂₁(4i+1)=π/4 radians, (14) θ₂₁(4i+2)=π/2 radians, and (15) θ₂₁(4i+3)=3π/4 radians. (The above is an example. It suffices for one each of zero radians, π/4 radians, π/2 radians, and 3π/4 radians to exist for the set (θ₂₁(4i), θ₂₁(4i+1), θ₂₁(4i+2), θ₂₁(4i+3)).) (Example #4) (16) θ₁₁(4i)=0 radians, (17) θ₁₁(4i+1)=π/4 radians, (18) θ₁₁(4i+2)=π/2 radians, (19) θ₁₁(4i+3)=3π/4 radians, and (20) θ₂₁(4i)=θ₂₁(4i+1)=θ₂₁(4i+2)=θ₂₁(4i+3)=0 radians. (The above is an example. It suffices for one each of zero radians, π/4 radians, π/2 radians, and 3π/4 radians to exist for the set (θ₁₁(4i), θ₁₁(4i+1), θ₁₁(4i+2), θ₁₁(4i+3)).)

While four examples have been shown, the method of satisfying Condition #1 is not limited to these examples.

Next, design requirements for not only θ₁₁ and θ₁₂, but also for λ and δ are described. It suffices to set λ to a certain value; it is then necessary to establish requirements for δ. The following describes the design method for δ when λ is set to zero radians.

In this case, by defining δ so that π/2 radians ≤|δ|≤π radians, excellent reception quality is achieved, particularly in an LOS environment.

Incidentally, for each of the symbol numbers 4i, 4i+1, 4i+2, and 4i+3, two points q exist where reception quality becomes poor. Therefore, a total of 2×4=8 such points exist. In an LOS environment, in order to prevent reception quality from degrading in a specific reception terminal, these eight points should each have a different solution. In this case, in addition to Condition #1, Condition #2 is necessary.

Math 63

Condition #2 e ^(j(θ) ¹¹ ^((4i+x)−θ) ²¹ ^((4i+x))) ≠e ^(j(θ) ¹¹ ^((4i+y)−θ) ²¹ ^((4i+y)−δ)) for ∀x,∀y(x,y=0,1,2,3) and e ^(j(θ) ¹¹ ^((4i+x)−θ) ²¹ ^((4i+x)−δ)) ≠e ^(j(θ) ¹¹ ^((4i+y)−θ) ²¹ ^((4i+y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2,3)

Additionally, the phase of these eight points should be evenly distributed (since the phase of a direct wave is considered to have a high probability of even distribution). The following describes the design method for δ to satisfy this requirement.

In the case of example #1 and example #2, the phase becomes even at the points at which reception quality is poor by setting δ to ±3π/4 radians. For example, letting δ be 3π/4 radians in example #1 (and letting A be a positive real number), then each of the four slots, points at which reception quality becomes poor exist once, as shown in FIG. 20. In the case of example #3 and example #4, the phase becomes even at the points at which reception quality is poor by setting δ to ±π radians. For example, letting δ be π radians in example #3, then in each of the four slots, points at which reception quality becomes poor exist once, as shown in FIG. 21. (If the element q in the channel matrix H exists at the points shown in FIGS. 20 and 21, reception quality degrades.)

With the above structure, excellent reception quality is achieved in an LOS environment. Above, an example of changing precoding weights in a four-slot period (cycle) is described, but below, changing precoding weights in an N-slot period (cycle) is described. Making the same considerations as in Embodiment 1 and in the above description, processing represented as below is performed on each symbol number.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 64

$\begin{matrix} {\begin{pmatrix} {z\; 1({Ni})} \\ {z\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & e^{j{({{\theta_{11}{({Ni})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({Ni})}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 62} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 65

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + 1} \right)} \\ {z\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & e^{j{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + 1})}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 63} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 66

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + k} \right)} \\ {z\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & e^{j{({{\theta_{11}{({{Ni} + k})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + k})}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 64} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 67

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + N - 1} \right)} \\ {z\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 65} \end{matrix}$

Accordingly, r1 and r2 are represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 68

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}({Ni})} & {h_{12}({Ni})} \\ {h_{21}({Ni})} & {h_{22}({Ni})} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & e^{j{({{\theta_{11}{({Ni})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({Ni})}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 66} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 69

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{Ni} + 1} \right)} & {h_{12}\left( {{Ni} + 1} \right)} \\ {h_{21}\left( {{Ni} + 1} \right)} & {h_{22}\left( {{Ni} + 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & e^{j{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + 1})}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 67} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 70

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{Ni} + k} \right)} & {h_{12}\left( {{Ni} + k} \right)} \\ {h_{21}\left( {{Ni} + k} \right)} & {h_{22}\left( {{Ni} + k} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & e^{j{({{\theta_{11}{({{Ni} + k})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + k})}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 68} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 71

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {h_{11}\left( {{Ni} + N - 1} \right)} & {h_{12}\left( {{Ni} + N - 1} \right)} \\ {h_{21}\left( {{Ni} + N - 1} \right)} & {h_{22}\left( {{Ni} + N - 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 69} \end{matrix}$

In this case, it is assumed that only components of direct waves exist in the channel elements h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t), that the amplitude components of the direct waves are all equal, and that fluctuations do not occur over time. With these assumptions, Equations 66-69 can be represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 72

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & e^{j{({{\theta_{11}{({Ni})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({Ni})}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 70} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 73

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & e^{j{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + 1})}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 71} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 74

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & e^{j{({{\theta_{11}{({{Ni} + k})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + k})}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 72} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 75

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 73} \end{matrix}$

In Equations 70-73, let A be a real number and q be a complex number. The values of A and q are determined in accordance with the positional relationship between the transmission device and the reception device. Equations 70-73 can be represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 76

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & e^{j{({{\theta_{11}{({Ni})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({Ni})}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 74} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 77

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & e^{j{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + 1})}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 75} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 78

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & e^{j{({{\theta_{11}{({{Ni} + k})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + k})}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 76} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 79

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}} \\ e^{j\;{\theta_{21}{({{Ni} + N - 1})}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\;\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 77} \end{matrix}$

As a result, when q is represented as follows, a signal component based on one of s1 and s2 is no longer included in r1 and r2, and therefore one of the signals s1 and s2 can no longer be obtained.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 80

$\begin{matrix} {{q = {- {Ae}^{j{({{\theta_{11}{({Ni})}} - {\theta_{21}{({Ni})}}})}}}},{- {Ae}^{j{({{\theta_{11}{({Ni})}} - {\theta_{21}{({Ni})}} - \delta})}}}} & {{Equation}\mspace{14mu} 78} \end{matrix}$

For symbol number Ni+1:

Math 81

$\begin{matrix} {{q = {- {Ae}^{j{({{\theta_{11}{({{Ni} + 1})}} - {\theta_{21}{({{Ni} + 1})}}})}}}},{- {Ae}^{j{({{\theta_{11}{({{Ni} + 1})}} - {\theta_{21}{({{Ni} + 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 79} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 82

$\begin{matrix} {{q = {- {Ae}^{j{({{\theta_{11}{({{Ni} + k})}} - {\theta_{21}{({{Ni} + k})}}})}}}},{- {Ae}^{j{({{\theta_{11}{({{Ni} + k})}} - {\theta_{21}{({{Ni} + k})}} - \delta})}}}} & {{Equation}\mspace{14mu} 80} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 83

$\begin{matrix} {{q = {- {Ae}^{j{({{\theta_{11}{({{Ni} + N - 1})}} - {\theta_{21}{({{Ni} + N - 1})}}})}}}},{- {Ae}^{j{({{\theta_{11}{({{Ni} + N - 1})}} - {\theta_{21}{({{Ni} + N - 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 81} \end{matrix}$

In this case, if q has the same solution in symbol numbers Ni through Ni+N−1, then since the channel elements of the direct waves do not greatly fluctuate, a reception device having channel elements in which the value of q is equivalent to this same solution can no longer obtain excellent reception quality for any of the symbol numbers. Therefore, it is difficult to achieve the ability to correct errors, even if error correction codes are introduced. Accordingly, for q not to have the same solution, the following condition is necessary from Equations 78-81 when focusing on one of two solutions of q which does not include δ.

Math 84

Condition #3 e ^(j(θ) ¹¹ ^((Ni+x)−θ) ²¹ ^((Ni+x))) ≠e ^(j(θ) ¹¹ ^((Ni+y)−θ) ²¹ ^((Ni+y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Next, design requirements for not only θ_(11l) and θ₁₂, but also for λ and δ are described. It suffices to set λ to a certain value; it is then necessary to establish requirements for δ. The following describes the design method for δ when λ is set to zero radians.

In this case, similar to the method of changing the precoding weights in a four-slot period (cycle), by defining δ so that π/2 radians ≤|δ|≤π radians, excellent reception quality is achieved, particularly in an LOS environment.

In each symbol number Ni through Ni+N−1, two points labeled q exist where reception quality becomes poor, and therefore 2N such points exist. In an LOS environment, in order to achieve excellent characteristics, these 2N points should each have a different solution. In this case, in addition to Condition #3, Condition #4 is necessary.

Math 85

Condition #4 e ^(j(θ) ¹¹ ^((Ni+x)−θ) ²¹ ^((Ni+x))) ≠e ^(j(θ) ¹¹ ^((Ni+y)−θ) ²¹ ^((Ni+y)−δ)) for ∀x,∀y(x,y=0,1,2, . . . ,N−2,N−1) and e ^(j(θ) ¹¹ ^((Ni+x)−θ) ²¹ ^((Ni+x)−δ)) ≠e ^(j(θ) ¹¹ ^((Ni+y)−θ) ²¹ ^((Ni+y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

Additionally, the phase of these 2N points should be evenly distributed (since the phase of a direct wave at each reception device is considered to have a high probability of even distribution).

As described above, when a transmission device transmits a plurality of modulated signals from a plurality of antennas in a MIMO system, the advantageous effect of improved transmission quality, as compared to conventional spatial multiplexing MIMO, is achieved in an LOS environment in which direct waves dominate by hopping between precoding weights regularly over time.

In the present embodiment, the structure of the reception device is as described in Embodiment 1, and in particular with regards to the structure of the reception device, operations have been described for a limited number of antennas, but the present invention may be embodied in the same way even if the number of antennas increases. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present embodiment. Furthermore, in the present embodiment, similar to Embodiment 1, the error correction codes are not limited.

In the present embodiment, in contrast with Embodiment 1, the method of changing the precoding weights in the time domain has been described. As described in Embodiment 1, however, the present invention may be similarly embodied by changing the precoding weights by using a multi-carrier transmission method and arranging symbols in the frequency domain and the frequency-time domain. Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, and the like), symbols for control information, and the like, may be arranged in the frame in any way.

Embodiment 3

In Embodiment 1 and Embodiment 2, the method of regularly hopping between precoding weights has been described for the case where the amplitude of each element in the precoding weight matrix is equivalent. In the present embodiment, however, an example that does not satisfy this condition is described.

For the sake of contrast with Embodiment 2, the case of changing precoding weights over an N-slot period (cycle) is described. Making the same considerations as in Embodiment 1 and Embodiment 2, processing represented as below is performed on each symbol number. Let β be a positive real number, and β≠1. For symbol number Ni (where i is an integer greater than or equal to zero):

Math 86

$\begin{matrix} {\begin{pmatrix} {z\; 1({Ni})} \\ {z\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & {\beta \times e^{j\;{({{\theta_{11}{({Ni})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({Ni})}}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 82} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 87

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + 1} \right)} \\ {z\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 83} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 88

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + k} \right)} \\ {z\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + k})}}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 84} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 89

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{Ni} + N - 1} \right)} \\ {z\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + N - 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 85} \end{matrix}$

Accordingly, r1 and r2 are represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 90

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}({Ni})} & {h_{12}({Ni})} \\ {h_{21}({Ni})} & {h_{22}({Ni})} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & {\beta \times e^{j\;{({{\theta_{11}{({Ni})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({Ni})}}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 86} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 91

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{Ni} + 1} \right)} & {h_{12}\left( {{Ni} + 1} \right)} \\ {h_{21}\left( {{Ni} + 1} \right)} & {h_{22}\left( {{Ni} + 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 87} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 92

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{Ni} + k} \right)} & {h_{12}\left( {{Ni} + k} \right)} \\ {h_{21}\left( {{Ni} + k} \right)} & {h_{22}\left( {{Ni} + k} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + k})}}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 88} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+N−1:

Math 93

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{Ni} + N - 1} \right)} & {h_{12}\left( {{Ni} + N - 1} \right)} \\ {h_{21}\left( {{Ni} + N - 1} \right)} & {h_{22}\left( {{Ni} + N - 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + N - 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 89} \end{matrix}$

In this case, it is assumed that only components of direct waves exist in the channel elements h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t), that the amplitude components of the direct waves are all equal, and that fluctuations do not occur over time. With these assumptions, Equations 86-89 can be represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 94

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2({Ni})} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & {\beta \times e^{j\;{({{\theta_{11}{({Ni})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({Ni})}}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 90} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 95

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{Ni} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 91} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 96

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{Ni} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + k})}}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 92} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 97

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & {\beta \times e^{j\;{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + N - 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 93} \end{matrix}$

In Equations 90-93, let A be a real number and q be a complex number. Equations 90-93 can be represented as follows.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 98

$\begin{matrix} {\begin{pmatrix} {r\; 1({Ni})} \\ {r\; 2\left( {N\; i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\left( {A\; e^{j\; 0}\mspace{14mu} q} \right)\begin{pmatrix} e^{j\;{\theta_{11}{({Ni})}}} & {\beta \times e^{j{({{\theta_{11}{({Ni})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({Ni})}}}} & e^{j{({{\theta_{21}{({Ni})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1({Ni})} \\ {s\; 2({Ni})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 94} \end{matrix}$

Here, j is an imaginary unit.

For symbol number Ni+1:

Math 99

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + 1} \right)} \\ {r\; 2\left( {{N\; i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\left( {A\; e^{j\; 0}\mspace{14mu} q} \right)\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{Ni} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + 1} \right)} \\ {s\; 2\left( {{Ni} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 95} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 100

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + k} \right)} \\ {r\; 2\left( {{N\; i} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\left( {A\; e^{j\; 0}\mspace{14mu} q} \right)\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + k})}}} & {\beta \times e^{j{({{\theta_{11}{({{Ni} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + k})}}}} & e^{j{({{\theta_{21}{({{Ni} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + k} \right)} \\ {s\; 2\left( {{Ni} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 96} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 101

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{Ni} + N - 1} \right)} \\ {r\; 2\left( {{N\; i} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\left( {A\; e^{j\; 0}\mspace{14mu} q} \right)\begin{pmatrix} e^{j\;{\theta_{11}{({{Ni} + N - 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{Ni} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{Ni} + N - 1})}}}} & e^{j{({{\theta_{21}{({{Ni} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{Ni} + N - 1} \right)} \\ {s\; 2\left( {{Ni} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 97} \end{matrix}$

As a result, when q is represented as follows, one of the signals s1 and s2 can no longer be obtained.

For symbol number Ni (where i is an integer greater than or equal to zero):

Math 102

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({Ni})}} - {\theta_{21}{({Ni})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({Ni})}} - {\theta_{21}{({Ni})}} - \delta})}}}} & {{Equation}\mspace{14mu} 98} \end{matrix}$

For symbol number Ni+1:

Math 103

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{Ni} + 1})}} - {\theta_{21}{({{Ni} + 1})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{Ni} + 1})}} - {\theta_{21}{({{Ni} + 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 99} \end{matrix}$

When generalized, this equation is as follows.

For symbol number Ni+k (k=0, 1, . . . , N−1):

Math 104

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{Ni} + k})}} - {\theta_{21}{({{Ni} + k})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{Ni} + k})}} - {\theta_{21}{({{Ni} + k})}} - \delta})}}}} & {{Equation}\mspace{14mu} 100} \end{matrix}$

Furthermore, for symbol number Ni+N−1:

Math 105

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{Ni} + N - 1})}} - {\theta_{21}{({{Ni} + N - 1})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{Ni} + N - 1})}} - {\theta_{21}{({{Ni} + N - 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 101} \end{matrix}$

In this case, if q has the same solution in symbol numbers Ni through Ni+N−1, then since the channel elements of the direct waves do not greatly fluctuate, excellent reception quality can no longer be obtained for any of the symbol numbers. Therefore, it is difficult to achieve the ability to correct errors, even if error correction codes are introduced. Accordingly, for q not to have the same solution, the following condition is necessary from Equations 98-101 when focusing on one of two solutions of q which does not include δ.

Math 106

Condition #5 e ^(j(θ) ¹¹ ^((Ni+x)−θ) ²¹ ^((Ni+x))) ≠e ^(j(θ) ¹¹ ^((Ni+y)−θ) ²¹ ^((Ni+y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Next, design requirements for not only θ₁₁ and θ₁₂, but also for λ and δ are described. It suffices to set λ to a certain value; it is then necessary to establish requirements for δ. The following describes the design method for δ when λ is set to zero radians.

In this case, similar to the method of changing the precoding weights in a four-slot period (cycle), by defining δ so that π/2 radians ≤|δ|≤π radians, excellent reception quality is achieved, particularly in an LOS environment.

In each of symbol numbers Ni through Ni+N−1, two points q exist where reception quality becomes poor, and therefore 2N such points exist. In an LOS environment, in order to achieve excellent characteristics, these 2N points should each have a different solution. In this case, in addition to Condition #5, considering that β is a positive real number, and β≠1, Condition #6 is necessary.

Math 107

Condition #6 e ^(j(θ) ¹¹ ^((Ni+x)−θ) ²¹ ^((Ni+x)−δ)) ≠e ^(j(θ) ¹¹ ^((Ni+y)−θ) ²¹ ^((Ni+y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

As described above, when a transmission device transmits a plurality of modulated signals from a plurality of antennas in a MIMO system, the advantageous effect of improved transmission quality, as compared to conventional spatial multiplexing MIMO, is achieved in an LOS environment in which direct waves dominate by hopping between precoding weights regularly over time.

In the present embodiment, the structure of the reception device is as described in Embodiment 1, and in particular with regards to the structure of the reception device, operations have been described for a limited number of antennas, but the present invention may be embodied in the same way even if the number of antennas increases. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present embodiment. Furthermore, in the present embodiment, similar to Embodiment 1, the error correction codes are not limited.

In the present embodiment, in contrast with Embodiment 1, the method of changing the precoding weights in the time domain has been described. As described in Embodiment 1, however, the present invention may be similarly embodied by changing the precoding weights by using a multi-carrier transmission method and arranging symbols in the frequency domain and the frequency-time domain. Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, and the like), symbols for control information, and the like, may be arranged in the frame in any way.

Embodiment 4

In Embodiment 3, the method of regularly hopping between precoding weights has been described for the example of two types of amplitudes for each element in the precoding weight matrix, 1 and β.

In this case,

Math 108

$\frac{1}{\sqrt{\beta^{2} + 1}}$

the above is ignored.

Next, the example of changing the value of β by slot is described. For the sake of contrast with Embodiment 3, the case of changing precoding weights over a 2×N-slot period (cycle) is described.

Making the same considerations as in Embodiment 1, Embodiment 2, and Embodiment 3, processing represented as below is performed on symbol numbers. Let β be a positive real number, and β≠1. Furthermore, let α be a positive real number, and α≠β.

For symbol number 2Ni (where i is an integer greater than or equal to zero):

Math 109

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {2\;{Ni}} \right)} \\ {z\; 2\left( {2\;{Ni}} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({2\;{Ni}})}}} & {\beta \times e^{j{({{\theta_{11}{({2\;{Ni}})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({2\;{Ni}})}}}} & e^{j{({{\theta_{21}{({2\;{Ni}})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {2\;{Ni}} \right)} \\ {s\; 2\left( {2\;{Ni}} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 102} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+1:

Math 110

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2\;{Ni}} + 1} \right)} \\ {z\; 2\left( {{2\;{Ni}} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2\;{Ni}} + 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2\;{Ni}} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2\;{Ni}} + 1})}}}} & e^{j{({{\theta_{21}{({{2\;{Ni}} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2\;{Ni}} + 1} \right)} \\ {s\; 2\left( {{2\;{Ni}} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 103} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+k (k=0, 1, . . . , N−1):

Math 111

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2\;{Ni}} + k} \right)} \\ {z\; 2\left( {{2\;{Ni}} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2\;{Ni}} + k})}}} & {\beta \times e^{j{({{\theta_{11}{({{2\;{Ni}} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2\;{Ni}} + k})}}}} & e^{j{({{\theta_{21}{({{2\;{Ni}} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2\;{Ni}} + k} \right)} \\ {s\; 2\left( {{2\;{Ni}} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 104} \end{matrix}$

Furthermore, for symbol number 2Ni+N−1:

Math 112

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2\;{Ni}} + N - 1} \right)} \\ {z\; 2\left( {{2\;{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2\;{Ni}} + N - 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2\;{Ni}} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2\;{Ni}} + N - 1})}}}} & e^{j{({{\theta_{21}{({{2\;{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2\;{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2\;{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 105} \end{matrix}$

For symbol number 2Ni+N (where i is an integer greater than or equal to zero):

Math 113

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2\;{Ni}} + N} \right)} \\ {z\; 2\left( {{2\;{Ni}} + N} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2\;{Ni}} + N})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2\;{Ni}} + N})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2\;{Ni}} + N})}}}} & e^{j{({{\theta_{21}{({{2\;{Ni}} + N})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2\;{Ni}} + N} \right)} \\ {s\; 2\left( {{2\;{Ni}} + N} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 106} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+N+1:

Math 114

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2\;{Ni}} + N + 1} \right)} \\ {z\; 2\left( {{2\;{Ni}} + N + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2\;{Ni}} + N + 1})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2\;{Ni}} + N + 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2\;{Ni}} + N + 1})}}}} & e^{j{({{\theta_{21}{({{2\;{Ni}} + N + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2\;{Ni}} + N + 1} \right)} \\ {s\; 2\left( {{2\;{Ni}} + N + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 107} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+N+k (k=0, 1, . . . , N−1):

Math 115

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2{Ni}} + N + k} \right)} \\ {z\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + k})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N + k})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + k} \right)} \\ {s\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 108} \end{matrix}$

Furthermore, for symbol number 2Ni+2N−1:

Math 116

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {z\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N - 1})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N - 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 109} \end{matrix}$

Accordingly, r1 and r2 are represented as follows.

For symbol number 2Ni (where i is an integer greater than or equal to zero):

Math 117

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {2{Ni}} \right)} \\ {r\; 2\left( {2{Ni}} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {2{Ni}} \right)} & {h_{12}\left( {2{Ni}} \right)} \\ {h_{21}\left( {2{Ni}} \right)} & {h_{22}\left( {2{Ni}} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({2{Ni}})}}} & {\beta \times e^{j{({{\theta_{11}{({2{Ni}})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({2{Ni}})}}}} & e^{j\;{({{\theta_{21}{({2{Ni}})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {2{Ni}} \right)} \\ {s\; 2\left( {2{Ni}} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 110} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+1:

Math 118

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + 1} \right)} & {h_{12}\left( {{2{Ni}} + 1} \right)} \\ {h_{21}\left( {{2{Ni}} + 1} \right)} & {h_{22}\left( {{2{Ni}} + 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 111} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+k (k=0, 1, . . . , N−1):

Math 119

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + k} \right)} \\ {r\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + k} \right)} & {h_{12}\left( {{2{Ni}} + k} \right)} \\ {h_{21}\left( {{2{Ni}} + k} \right)} & {h_{22}\left( {{2{Ni}} + k} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + k})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + k} \right)} \\ {s\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 112} \end{matrix}$

Furthermore, for symbol number 2Ni+N−1:

Math 120

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + N - 1} \right)} & {h_{12}\left( {{2{Ni}} + N - 1} \right)} \\ {h_{21}\left( {{2{Ni}} + N - 1} \right)} & {h_{22}\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N - 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + N - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 113} \end{matrix}$

For symbol number 2Ni+N (where i is an integer greater than or equal to zero):

Math 121

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N} \right)} \\ {r\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + N} \right)} & {h_{12}\left( {{2{Ni}} + N} \right)} \\ {h_{21}\left( {{2{Ni}} + N} \right)} & {h_{22}\left( {{2{Ni}} + N} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N} \right)} \\ {s\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 114} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+N+1:

Math 122

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + N + 1} \right)} & {h_{12}\left( {{2{Ni}} + N + 1} \right)} \\ {h_{21}\left( {{2{Ni}} + N + 1} \right)} & {h_{22}\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + 1})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N + 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 115} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+N+k (k=0, 1, . . . , N−1):

Math 123

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + k} \right)} \\ {r\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + N + k} \right)} & {h_{12}\left( {{2{Ni}} + N + k} \right)} \\ {h_{21}\left( {{2{Ni}} + N + k} \right)} & {h_{22}\left( {{2{Ni}} + N + k} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + k})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N + k})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + k} \right)} \\ {s\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 116} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+2N−1:

Math 124

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + {2N} - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + {2N} - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {h_{11}\left( {{2{Ni}} + {2N} - 1} \right)} & {h_{12}\left( {{2{Ni}} + {2N} - 1} \right)} \\ {h_{21}\left( {{2{Ni}} + {2N} - 1} \right)} & {h_{22}\left( {{2{Ni}} + {2N} - 1} \right)} \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + {2N} - 1})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + {2N} - 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + {2N} - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + {2N} - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + {2N} - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + {2N} - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 117} \end{matrix}$

In this case, it is assumed that only components of direct waves exist in the channel elements h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t), that the amplitude components of the direct waves are all equal, and that fluctuations do not occur over time. With these assumptions, Equations 110-117 can be represented as follows.

For symbol number 2Ni (where i is an integer greater than or equal to zero):

Math 125

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {2{Ni}} \right)} \\ {r\; 2\left( {2{Ni}} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({2{Ni}})}}} & {\beta \times e^{j{({{\theta_{11}{({2{Ni}})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({2{Ni}})}}}} & e^{j\;{({{\theta_{21}{({2{Ni}})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {2{Ni}} \right)} \\ {s\; 2\left( {2{Ni}} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 118} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+1:

Math 126

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 119} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+k (k=0, 1, . . . , N−1):

Math 127

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + k} \right)} \\ {r\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + k})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + k} \right)} \\ {s\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 120} \end{matrix}$

Furthermore, for symbol number 2Ni+N−1:

Math 128

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N - 1})}}} & {\beta \times e^{j{({{\theta_{11}{({{2{Ni}} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + N - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 121} \end{matrix}$

For symbol number 2Ni+N (where i is an integer greater than or equal to zero):

Math 129

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N} \right)} \\ {r\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N})}}} & {\alpha \times e^{j{({{\theta_{11}{({{2{Ni}} + N})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N} \right)} \\ {s\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 122} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+N+1:

Math 130

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + 1})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N + 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 123} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+N+k (k=0, 1, . . . , N−1):

Math 131

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + k} \right)} \\ {r\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + k})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N + k})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + k} \right)} \\ {s\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 124} \end{matrix}$

Furthermore, for symbol number 2Ni+2N−1:

Math 132

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N - 1})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N - 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 125} \end{matrix}$

In Equations 118-125, let A be a real number and q be a complex number.

Equations 118-125 can be represented as follows.

For symbol number 2Ni (where i is an integer greater than or equal to zero):

Math 133

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {2{Ni}} \right)} \\ {r\; 2\left( {2{Ni}} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({2{Ni}})}}} & {\beta \times e^{j{({{\theta{({2{Ni}})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({2{Ni}})}}}} & e^{j\;{({{\theta_{21}{({2{Ni}})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {2{Ni}} \right)} \\ {s\; 2\left( {2{Ni}} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 126} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+1:

Math 134

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + 1})}}} & {\beta \times e^{j{({{\theta{({{2{Ni}} + 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 127} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+k (k=0, 1, . . . , N−1):

Math 135

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + k} \right)} \\ {r\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + k})}}} & {\beta \times e^{j{({{\theta{({{2{Ni}} + k})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + k} \right)} \\ {s\; 2\left( {{2{Ni}} + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 128} \end{matrix}$

Furthermore, for symbol number 2Ni+N−1:

Math 136

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\beta^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N - 1})}}} & {\beta \times e^{j{({{\theta{({{2{Ni}} + N - 1})}} + \lambda})}}} \\ {\beta \times e^{j\;{\theta_{21}{({{2{Ni}} + N - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 129} \end{matrix}$

For symbol number 2Ni+N (where i is an integer greater than or equal to zero):

Math 137

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N} \right)} \\ {r\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N} \right)} \\ {s\; 2\left( {{2{Ni}} + N} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 130} \end{matrix}$

Here, j is an imaginary unit.

For symbol number 2Ni+N+1:

Math 138

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {r\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + 1})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N + 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + 1} \right)} \\ {s\; 2\left( {{2{Ni}} + N + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 131} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+N+k (k=0, 1, . . . , N−1):

Math 139

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + N + k} \right)} \\ {r\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + N + k})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + N + k})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + N + k})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + N + k})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + N + k} \right)} \\ {s\; 2\left( {{2{Ni}} + N + k} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 132} \end{matrix}$

Furthermore, for symbol number 2Ni+2N−1:

Math 140

$\begin{matrix} {\begin{pmatrix} {r\; 1\left( {{2{Ni}} + {2N} - 1} \right)} \\ {r\; 2\left( {{2{Ni}} + {2N} - 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{({{2{Ni}} + {2N} - 1})}}} & {\alpha \times e^{j{({{\theta{({{2{Ni}} + {2N} - 1})}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{({{2{Ni}} + {2N} - 1})}}}} & e^{j\;{({{\theta_{21}{({{2{Ni}} + {2N} - 1})}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{2{Ni}} + {2N} - 1} \right)} \\ {s\; 2\left( {{2{Ni}} + {2N} - 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 133} \end{matrix}$

As a result, when q is represented as follows, one of the signals s1 and s2 can no longer be obtained.

For symbol number 2Ni (where i is an integer greater than or equal to zero):

Math 141

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({2{Ni}})}} - {\theta_{21}{({2{Ni}})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({2{Ni}})}} - {\theta_{21}{({2{Ni}})}} - \delta})}}}} & {{Equation}\mspace{14mu} 134} \end{matrix}$

For symbol number 2Ni+1:

Math 142

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{2{Ni}} + 1})}} - {\theta_{21}{({{2{Ni}} + 1})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{2{Ni}} + 1})}} - {\theta_{21}{({{2{Ni}} + 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 135} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+k (k=0, 1, . . . , N−1):

Math 143

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{2{Ni}} + k})}} - {\theta_{21}{({{2{Ni}} + k})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{2{Ni}} + k})}} - {\theta_{21}{({{2{Ni}} + k})}} - \delta})}}}} & {{Equation}\mspace{14mu} 136} \end{matrix}$

Furthermore, for symbol number 2Ni+N−1:

Math 144

$\begin{matrix} {{q = {{- \frac{A}{\beta}}e^{j{({{\theta_{11}{({{2{Ni}} + N - 1})}} - {\theta_{21}{({{2{Ni}} + N - 1})}}})}}}},{{- A}\;\beta\; e^{j{({{\theta_{11}{({{2{Ni}} + N - 1})}} - {\theta_{21}{({{2{Ni}} + N - 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 167} \end{matrix}$

For symbol number 2Ni+N (where i is an integer greater than or equal to zero):

Math 145

$\begin{matrix} {{q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{({{2{Ni}} + N})}} - {\theta_{21}{({{2{Ni}} + N})}}})}}}},{{- A}\;\alpha\; e^{j{({{\theta_{11}{({{2{Ni}} + N})}} - {\theta_{21}{({{2{Ni}} + N})}} - \delta})}}}} & {{Equation}\mspace{14mu} 138} \end{matrix}$

For symbol number 2Ni+N+1:

Math 146

$\begin{matrix} {{q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{({{2{Ni}} + N + 1})}} - {\theta_{21}{({{2{Ni}} + N + 1})}}})}}}},{{- A}\;\alpha\; e^{j{({{\theta_{11}{({{2{Ni}} + N + 1})}} - {\theta_{21}{({{2{Ni}} + N + 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 139} \end{matrix}$

When generalized, this equation is as follows.

For symbol number 2Ni+N+k (k=0, 1, . . . , N−1):

Math 147

$\begin{matrix} {{q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{({{2{Ni}} + N + k})}} - {\theta_{21}{({{2{Ni}} + N + k})}}})}}}},{{- A}\;\alpha\; e^{j{({{\theta_{11}{({{2{Ni}} + N + k})}} - {\theta_{21}{({{2{Ni}} + N + k})}} - \delta})}}}} & {{Equation}\mspace{14mu} 140} \end{matrix}$

Furthermore, for symbol number 2Ni+2N−1:

Math 148

$\begin{matrix} {{q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{({{2{Ni}} + {2N} - 1})}} - {\theta_{21}{({{2{Ni}} + {2N} - 1})}}})}}}},{{- A}\;\alpha\; e^{j{({{\theta_{11}{({{2{Ni}} + {2N} - 1})}} - {\theta_{21}{({{2{Ni}} + {2N} - 1})}} - \delta})}}}} & {{Equation}\mspace{14mu} 141} \end{matrix}$

In this case, if q has the same solution in symbol numbers 2Ni through 2Ni+N−1, then since the channel elements of the direct waves do not greatly fluctuate, excellent reception quality can no longer be obtained for any of the symbol numbers. Therefore, it is difficult to achieve the ability to correct errors, even if error correction codes are introduced. Accordingly, for q not to have the same solution, Condition #7 or Condition #8 becomes necessary from Equations 134-141 and from the fact that α≠β when focusing on one of two solutions of q which does not include δ.

Math 149

Condition #7 e ^(j(θ) ¹¹ ^((2Ni+x)−θ) ²¹ ^((2Ni+x))) ≠e ^(j(θ) ¹¹ ^((2Ni+y)−θ) ²¹ ^((2Ni+y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.) and e ^(j(θ) ¹¹ ^((2Ni+N+x)−θ) ²¹ ^((2Ni+N+x))) ≠e ^(j(θ) ¹¹ ^((2Ni+N+y)−θ) ²¹ ^((2Ni+N+y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 150

Condition #8 e ^(j(θ) ¹¹ ^((2Ni+x)−θ) ²¹ ^((2Ni+x)) ≠e ^(j(θ) ¹¹ ^((2Ni+y)−θ) ²¹ ^((2Ni+y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,2N−2,2N−1)

In this case, Condition #8 is similar to the conditions described in Embodiment 1 through Embodiment 3. However, with regards to Condition #7, since α≠β, the solution not including δ among the two solutions of q is a different solution.

Next, design requirements for not only θ₁₁ and θ₁₂, but also for λ and δ are described. It suffices to set λ to a certain value; it is then necessary to establish requirements for δ. The following describes the design method for δ when λ is set to zero radians.

In this case, similar to the method of changing the precoding weights in a four-slot period (cycle), by defining δ so that π/2 radians ≤|δ|≤π radians, excellent reception quality is achieved, particularly in an LOS environment.

In symbol numbers 2Ni through 2Ni+2N−1, two points q exist where reception quality becomes poor, and therefore 4N such points exist. In an LOS environment, in order to achieve excellent characteristics, these 4N points should each have a different solution. In this case, focusing on amplitude, the following condition is necessary for Condition #7 or Condition #8, since α≠β.

Math 151

Condition #9 α≠1/β

As described above, when a transmission device transmits a plurality of modulated signals from a plurality of antennas in a MIMO system, the advantageous effect of improved transmission quality, as compared to conventional spatial multiplexing MIMO system, is achieved in an LOS environment in which direct waves dominate by hopping between precoding weights regularly over time.

In the present embodiment, the structure of the reception device is as described in Embodiment 1, and in particular with regards to the structure of the reception device, operations have been described for a limited number of antennas, but the present invention may be embodied in the same way even if the number of antennas increases. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present embodiment. Furthermore, in the present embodiment, similar to Embodiment 1, the error correction codes are not limited.

In the present embodiment, in contrast with Embodiment 1, the method of changing the precoding weights in the time domain has been described. As described in Embodiment 1, however, the present invention may be similarly embodied by changing the precoding weights by using a multi-carrier transmission method and arranging symbols in the frequency domain and the frequency-time domain. Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, and the like), symbols for control information, and the like, may be arranged in the frame in any way.

Embodiment 5

In Embodiment 1 through Embodiment 4, the method of regularly hopping between precoding weights has been described. In the present embodiment, a modification of this method is described.

In Embodiment 1 through Embodiment 4, the method of regularly hopping between precoding weights as in FIG. 6 has been described. In the present embodiment, a method of regularly hopping between precoding weights that differs from FIG. 6 is described.

As in FIG. 6, this method hops between four different precoding weights (matrices). FIG. 22 shows the hopping method that differs from FIG. 6. In FIG. 22, four different precoding weights (matrices) are represented as W1, W2, W3, and W4. (For example, W1 is the precoding weight (matrix) in Equation 37, W2 is the precoding weight (matrix) in Equation 38, W3 is the precoding weight (matrix) in Equation 39, and W4 is the precoding weight (matrix) in Equation 40.) In FIG. 3, elements that operate in a similar way to FIG. 3 and FIG. 6 bear the same reference signs.

The parts unique to FIG. 22 are as follows.

-   -   The first period (cycle) 2201, the second period (cycle) 2202,         the third period (cycle) 2203, . . . are all four-slot periods         (cycles).     -   A different precoding weight matrix is used in each of the four         slots, i.e. W1, W2, W3, and W4 are each used once.     -   It is not necessary for W1, W2, W3, and W4 to be in the same         order in the first period (cycle) 2201, the second period         (cycle) 2202, the third period (cycle) 2203, . . . .

In order to implement this method, a precoding weight generating unit 2200 receives, as an input, a signal regarding a weighting method and outputs information 2210 regarding precoding weights in order for each period (cycle). The weighting unit 600 receives, as inputs, this information, s1(t), and s2(t), performs weighting, and outputs z1(t) and z2(t).

FIG. 23 shows a different weighting method than FIG. 22 for the above precoding method. In FIG. 23, the difference from FIG. 22 is that a similar method to FIG. 22 is achieved by providing a reordering unit after the weighting unit and by reordering signals.

In FIG. 23, the precoding weight generating unit 2200 receives, as an input, information 315 regarding a weighting method and outputs information 2210 on precoding weights in the order of precoding weights W1, W2, W3, W4, W1, W2, W3, W4, . . . . Accordingly, the weighting unit 600 uses the precoding weights in the order of precoding weights W1, W2, W3, W4, W1, W2, W3, W4, . . . and outputs precoded signals 2300A and 2300B.

A reordering unit 2300 receives, as inputs, the precoded signals 2300A and 2300B, reorders the precoded signals 2300A and 2300B in the order of the first period (cycle) 2201, the second period (cycle) 2202, and the third period (cycle) 2203 in FIG. 23, and outputs z1(t) and z2(t).

Note that in the above description, the period (cycle) for hopping between precoding weights has been described as having four slots for the sake of comparison with FIG. 6. As in Embodiment 1 through Embodiment 4, however, the present invention may be similarly embodied with a period (cycle) having other than four slots.

Furthermore, in Embodiment 1 through Embodiment 4, and in the above precoding method, within the period (cycle), the value of δ and β has been described as being the same for each slot, but the value of δ and β may change in each slot.

As described above, when a transmission device transmits a plurality of modulated signals from a plurality of antennas in a MIMO system, the advantageous effect of improved transmission quality, as compared to conventional spatial multiplexing MIMO, is achieved in an LOS environment in which direct waves dominate by hopping between precoding weights regularly over time.

In the present embodiment, the structure of the reception device is as described in Embodiment 1, and in particular with regards to the structure of the reception device, operations have been described for a limited number of antennas, but the present invention may be embodied in the same way even if the number of antennas increases. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present embodiment. Furthermore, in the present embodiment, similar to Embodiment 1, the error correction codes are not limited.

In the present embodiment, in contrast with Embodiment 1, the method of changing the precoding weights in the time domain has been described. As described in Embodiment 1, however, the present invention may be similarly embodied by changing the precoding weights by using a multi-carrier transmission method and arranging symbols in the frequency domain and the frequency-time domain. Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, and the like), symbols for control information, and the like, may be arranged in the frame in any way.

Embodiment 6

In Embodiments 1-4, a method for regularly hopping between precoding weights has been described. In the present embodiment, a method for regularly hopping between precoding weights is again described, including the content that has been described in Embodiments 1-4.

First, out of consideration of an LOS environment, a method of designing a precoding matrix is described for a 2×2 spatial multiplexing MIMO system that adopts precoding in which feedback from a communication partner is not available.

FIG. 30 shows a model of a 2×2 spatial multiplexing MIMO system that adopts precoding in which feedback from a communication partner is not available. An information vector z is encoded and interleaved. As output of the interleaving, an encoded bit vector u(p)=(u₁(p), u₂(p)) is acquired (where p is the slot time). Let u_(i)(p)=(u_(i1)(p), . . . , u_(ih)(p)) (where h is the number of transmission bits per symbol). Letting a signal after modulation (mapping) be s(p)=(s1(p), s2(p))^(T) and a precoding matrix be F(p), a precoded symbol x(p)=(x₁(p), x₂(p))^(T) is represented by the following equation.

Math 152

$\begin{matrix} \begin{matrix} {{x(p)} = \left( {{x_{1}(p)},{x_{2}(p)}} \right)^{T}} \\ {= {{F(p)}{s(p)}}} \end{matrix} & {{Equation}\mspace{14mu} 142} \end{matrix}$

Accordingly, letting a received vector be y(p)=(y₁(p), y₂(p))^(T), the received vector y(p) is represented by the following equation.

Math 153

$\begin{matrix} \begin{matrix} {{y(p)} = \left( {{y_{1}(p)},{y_{2}(p)}} \right)^{T}} \\ {= {{{H(p)}{F(p)}{s(p)}} + {n(p)}}} \end{matrix} & {{Equation}\mspace{14mu} 143} \end{matrix}$

In this Equation, H(p) is the channel matrix, n(p)=(n₁(p), n₂(p))^(T) is the noise vector, and n_(i)(p) is the i.i.d. complex white Gaussian noise with 0 mean and variance σ². Letting the Rician factor be K, the above equation can be represented as follows.

Math 154

$\begin{matrix} \begin{matrix} {{y(p)} = \left( {{y_{1}(p)},{y_{2}(p)}} \right)^{T}} \\ {= \left( {{\sqrt{\frac{K}{K + 1}}{H_{d}(p)}} + {\sqrt{\frac{1}{K + 1}}{H_{s}(p)}}} \right)} \\ {{F(p){s(p)}} + {n(p)}} \end{matrix} & {{Equation}\mspace{14mu} 144} \end{matrix}$

In this equation, H_(d)(p) is the channel matrix for the direct wave components, and H_(s)(p) is the channel matrix for the scattered wave components. Accordingly, the channel matrix H(p) is represented as follows.

Math 155

$\begin{matrix} \begin{matrix} {{H(p)} = {{\sqrt{\frac{K}{K + 1}}{H_{d}(p)}} + {\sqrt{\frac{1}{K + 1}}{H_{s}(p)}}}} \\ {= {{\sqrt{\frac{K}{K + 1}}\begin{pmatrix} h_{11,d} & h_{12,d} \\ h_{21,d} & h_{22,d} \end{pmatrix}} +}} \\ {\sqrt{\frac{1}{K + 1}}\begin{pmatrix} {h_{11,s}(p)} & {h_{12,s}(p)} \\ {h_{21,s}(p)} & {h_{22,s}(p)} \end{pmatrix}} \end{matrix} & {{Equation}\mspace{14mu} 145} \end{matrix}$

In Equation 145, it is assumed that the direct wave environment is uniquely determined by the positional relationship between transmitters, and that the channel matrix H_(d)(p) for the direct wave components does not fluctuate with time. Furthermore, in the channel matrix H_(d)(p) for the direct wave components, it is assumed that as compared to the interval between transmit antennas, the probability of an environment with a sufficiently long distance between transmission and reception devices is high, and therefore that the channel matrix for the direct wave components can be treated as a regular matrix. Accordingly, the channel matrix H_(d)(p) is represented as follows.

Math 156

$\begin{matrix} \begin{matrix} {{H_{d}(p)} = \begin{pmatrix} h_{11,d} & h_{12,d} \\ h_{21,d} & h_{22,d} \end{pmatrix}} \\ {= \begin{pmatrix} {Ae}^{j\;\psi} & q \\ {Ae}^{j\;\psi} & q \end{pmatrix}} \end{matrix} & {{Equation}\mspace{14mu} 146} \end{matrix}$

In this equation, let A be a positive real number and q be a complex number. Subsequently, out of consideration of an LOS environment, a method of designing a precoding matrix is described for a 2×2 spatial multiplexing MIMO system that adopts precoding in which feedback from a communication partner is not available.

From Equations 144 and 145, it is difficult to seek a precoding matrix without appropriate feedback in conditions including scattered waves, since it is difficult to perform analysis under conditions including scattered waves. Additionally, in a NLOS environment, little degradation in reception quality of data occurs as compared to an LOS environment. Therefore, the following describes a method of designing precoding matrices without appropriate feedback in an LOS environment (precoding matrices for a precoding method that hops between precoding matrices over time).

As described above, since it is difficult to perform analysis under conditions including scattered waves, an appropriate precoding matrix for a channel matrix including components of only direct waves is sought from Equations 144 and 145. Therefore, in Equation 144, the case when the channel matrix includes components of only direct waves is considered. It follows that from Equation 146, Equation 144 can be represented as follows.

Math 157

$\begin{matrix} \begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{{H_{d}(p)}{F(p)}{s(p)}} + {n(p)}}} \\ {= {{\begin{pmatrix} {Ae}^{j\;\psi} & q \\ {Ae}^{j\;\psi} & q \end{pmatrix}{F(p)}{s(p)}} + {n(p)}}} \end{matrix} & {{Equation}\mspace{14mu} 147} \end{matrix}$

In this equation, a unitary matrix is used as the precoding matrix. Accordingly, the precoding matrix is represented as follows.

Math 158

$\begin{matrix} {{F(p)} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 148} \end{matrix}$

In this equation, λ is a fixed value. Therefore, Equation 147 can be represented as follows.

Math 159

$\begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\;\psi} & q \\ {Ae}^{j\;\psi} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} + {n(p)}}} & {{Equation}\mspace{14mu} 149} \end{matrix}$

As is clear from Equation 149, when the reception device performs linear operation of Zero Forcing (ZF) or the Minimum Mean Squared Error (MMSE), the transmitted bit cannot be determined by s1(p), s2(p). Therefore, the iterative APP (or iterative Max-log APP) or APP (or Max-log APP) described in Embodiment 1 is performed (hereafter referred to as Maximum Likelihood (ML) calculation), the log-likelihood ratio of each bit transmitted in s1(p), s2(p) is sought, and decoding with error correction codes is performed. Accordingly, the following describes a method of designing a precoding matrix without appropriate feedback in an LOS environment for a reception device that performs ML calculation.

The precoding in Equation 149 is considered. The right-hand side and left-hand side of the first line are multiplied by e^(−jΨ), and similarly the right-hand side and left-hand side of the second line are multiplied by e^(−jΨ). The following equation represents the result.

Math 160

$\begin{matrix} {\begin{pmatrix} {e^{{- j}\;\psi}{y_{1}(p)}} \\ {e^{{- j}\;\psi}{y_{2}(p)}} \end{pmatrix}\begin{matrix} {= {e^{{- j}\;\psi}\left\{ {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\;\psi} & q \\ {Ae}^{j\;\psi} & q \end{pmatrix}} \right.}} \\ {{\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} +} \\ \left. {n(p)} \right\} \\ {= {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & {e^{{- j}\;\psi}q} \\ {Ae}^{j\; 0} & {e^{{- j}\;\psi}q} \end{pmatrix}}} \\ {{\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} +} \\ {e^{{- j}\;\psi}{n(p)}} \end{matrix}} & {{Equation}\mspace{14mu} 150} \end{matrix}$

e^(−jΨ)y₁(p), e^(−jΨ)y₂(p), and e^(−jΨ)q are respectively redefined as y₁(p), y₂(p), and q. Furthermore, since e^(−jΨ)n(p)=(e^(−jΨ)n₁(p), e^(−jΨ)n₂(p))^(T), and e^(−jΨ)n₁(p), e^(−jΨ)n₂(p) are the independent identically distributed (i.i.d.) complex Gaussian random noise with an average value 0 and variance σ², e^(−jΨ)n(p) is redefined as n(p). As a result, generality is not lost by restating Equation 150 as Equation 151.

Math 161

$\begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} + {n(p)}}} & {{Equation}\mspace{14mu} 151} \end{matrix}$

Next, Equation 151 is transformed into Equation 152 for the sake of clarity.

Math 162

$\begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \pi})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} + {n(p)}}} & {{Equation}\mspace{14mu} 152} \end{matrix}$

In this case, letting the minimum Euclidian distance between a received signal point and a received candidate signal point be d_(min) ², then a poor point has a minimum value of zero for d_(min) ², and two values of q exist at which conditions are poor in that all of the bits transmitted by s1(p) and all of the bits transmitted by s2(p) being eliminated.

In Equation 152, when s1(p) does not exist.

Math 163

$\begin{matrix} {q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{(p)}} - {\theta_{21}{(p)}}})}}}} & {{Equation}\mspace{14mu} 153} \end{matrix}$

In Equation 152, when s2(p) does not exist.

Math 164 q=−Aα _(e) ^(j(θ) ¹¹ ^((p)−θ) ²¹ ^((p)−π))  Equation 154

(Hereinafter, the values of q satisfying Equations 153 and 154 are respectively referred to as “poor reception points for s1 and s2”).

When Equation 153 is satisfied, since all of the bits transmitted by s1(p) are eliminated, the received log-likelihood ratio cannot be sought for any of the bits transmitted by s1(p). When Equation 154 is satisfied, since all of the bits transmitted by s2(p) are eliminated, the received log-likelihood ratio cannot be sought for any of the bits transmitted by s2(p).

A broadcast/multicast transmission system that does not change the precoding matrix is now considered. In this case, a system model is considered in which a base station transmits modulated signals using a precoding method that does not hop between precoding matrices, and a plurality of terminals (Γ terminals) receive the modulated signals transmitted by the base station.

It is considered that the conditions of direct waves between the base station and the terminals change little over time. Therefore, from Equations 153 and 154, for a terminal that is in a position fitting the conditions of Equation 155 or Equation 156 and that is in an LOS environment where the Rician factor is large, the possibility of degradation in the reception quality of data exists. Accordingly, to resolve this problem, it is necessary to change the precoding matrix over time.

Math 165

$\begin{matrix} {q \approx {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{(p)}} - {\theta_{21}{(p)}}})}}}} & {{Equation}\mspace{14mu} 155} \end{matrix}$ Math 166 q≈−Aα _(e) ^(j(θ) ¹¹ ^((p)−θ) ²¹ ^((p)−π))  Equation 156

A method of regularly hopping between precoding matrices over a time period (cycle) with N slots (hereinafter referred to as a precoding hopping method) is considered.

Since there are N slots in the time period (cycle), N varieties of precoding matrices F[i] based on Equation 148 are prepared (i=0, 1, . . . , N−1). In this case, the precoding matrices F[i] are represented as follows.

Math 167

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{\lbrack i\rbrack}}}} & e^{j{({{\theta_{21}{\lbrack i\rbrack}} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 157} \end{matrix}$

In this equation, let α not change over time, and let λ also not change over time (though change over time may be allowed).

As in Embodiment 1, F[i] is the precoding matrix used to obtain a precoded signal x (p=N×k+i) in Equation 142 for time N×k+i (where k is an integer equal to or greater than 0, and i=0, 1, . . . , N−1). The same is true below as well.

At this point, based on Equations 153 and 154, design conditions such as the following are important for the precoding matrices for precoding hopping.

Math 168

Condition #10

$\begin{matrix} {{e^{j{({{\theta_{11}{\lbrack x\rbrack}} - {\theta_{21}{\lbrack x\rbrack}}})}} \neq e^{j{({{\theta_{11}{\lbrack y\rbrack}} - {\theta_{21}{\lbrack y\rbrack}}})}}}{{{for}\mspace{14mu}{\forall x}},{\forall{y\left( {{{x \neq y};x},{y = 0},1,\ldots\mspace{14mu},{N - 1}} \right)}}}} & {{Equation}\mspace{14mu} 158} \end{matrix}$ Math 169 Condition #11

$\begin{matrix} {{e^{j{({{\theta_{11}{\lbrack x\rbrack}} - {\theta_{21}{\lbrack x\rbrack}} - \pi})}} \neq e^{j{({{\theta_{11}{\lbrack y\rbrack}} - {\theta_{21}{\lbrack y\rbrack}} - \pi})}}}{{{for}\mspace{14mu}{\forall x}},{\forall{y\left( {{{x \neq y};x},{y = 0},1,\ldots\mspace{14mu},{N - 1}} \right)}}}} & {{Equation}\mspace{14mu} 159} \end{matrix}$

From Condition #10, in all of the Γ terminals, there is one slot or less having poor reception points for s1 among the N slots in a time period (cycle). Accordingly, the log-likelihood ratio for bits transmitted by s1(p) can be obtained for at least N−1 slots. Similarly, from Condition #11, in all of the Γ terminals, there is one slot or less having poor reception points for s2 among the N slots in a time period (cycle). Accordingly, the log-likelihood ratio for bits transmitted by s2(p) can be obtained for at least N−1 slots.

In this way, by providing the precoding matrix design model of Condition #10 and Condition #11, the number of bits for which the log-likelihood ratio is obtained among the bits transmitted by s1(p), and the number of bits for which the log-likelihood ratio is obtained among the bits transmitted by s2(p) is guaranteed to be equal to or greater than a fixed number in all of the Γ terminals. Therefore, in all of the Γ terminals, it is considered that degradation of data reception quality is moderated in an LOS environment where the Rician factor is large.

The following shows an example of a precoding matrix in the precoding hopping method.

The probability density distribution of the phase of a direct wave can be considered to be evenly distributed over [0 2π]. Therefore, the probability density distribution of the phase of q in Equations 151 and 152 can also be considered to be evenly distributed over [0 2π]. Accordingly, the following is established as a condition for providing fair data reception quality insofar as possible for Γ terminals in the same LOS environment in which only the phase of q differs.

Condition #12

When using a precoding hopping method with an N-slot time period (cycle), among the N slots in the time period (cycle), the poor reception points for s1 are arranged to have an even distribution in terms of phase, and the poor reception points for s2 are arranged to have an even distribution in terms of phase.

The following describes an example of a precoding matrix in the precoding hopping method based on Condition #10 through Condition #12. Let α=1.0 in the precoding matrix in Equation 157.

(Example #5)

Let the number of slots N in the time period (cycle) be 8. In order to satisfy Condition #10 through Condition #12, precoding matrices for a precoding hopping method with an N=8 time period (cycle) are provided as in the following equation.

Math 170

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;\frac{i\;\pi}{4}} & e^{j{({\frac{i\;\pi}{4} + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 160} \end{matrix}$

Here, j is an imaginary unit, and i=0, 1, . . . , 7. Instead of Equation 160, Equation 161 may be provided (where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 171

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 161} \end{matrix}$

Accordingly, the poor reception points for s1 and s2 become as in FIGS. 31A and 31B. (In FIGS. 31A and 31B, the horizontal axis is the real axis, and the vertical axis is the imaginary axis.) Instead of Equations 160 and 161, Equations 162 and 163 may be provided (where i=0, 1, . . . , 7, and where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 172

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;{({- \frac{i\;\pi}{4}})}} & e^{j{({{- \frac{i\;\pi}{4}} + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 162} \end{matrix}$ Math 173

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 163} \end{matrix}$

Next, the following is established as a condition, different from Condition #12, for providing fair data reception quality insofar as possible for Γ terminals in the same LOS environment in which only the phase of q differs.

Condition #13

When using a precoding hopping method with an N-slot time period (cycle), in addition to the condition

Math 174

$\begin{matrix} {{e^{j{({{\theta_{11}{\lbrack x\rbrack}} - {\theta_{21}{\lbrack x\rbrack}}})}} \neq e^{j{({{\theta_{11}{\lbrack y\rbrack}} - {\theta_{21}{\lbrack y\rbrack}} - \pi})}}}{{{for}\mspace{14mu}{\forall x}},{\forall{y\left( {x,{y = 0},1,\ldots\mspace{14mu},{N - 1}} \right)}}}} & {{Equation}\mspace{14mu} 164} \end{matrix}$

the poor reception points for s1 and the poor reception points for s2 are arranged to be in an even distribution with respect to phase in the N slots in the time period (cycle).

The following describes an example of a precoding matrix in the precoding hopping method based on Condition #10, Condition #11, and Condition #13. Let α=1.0 in the precoding matrix in Equation 157.

(Example #6)

Let the number of slots N in the time period (cycle) be 4. Precoding matrices for a precoding hopping method with an N=4 time period (cycle) are provided as in the following equation.

Math 175

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;\frac{i\;\pi}{4}} & e^{j{({\frac{i\;\pi}{4} + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 165} \end{matrix}$

Here, j is an imaginary unit, and i=0, 1, 2, 3. Instead of Equation 165, Equation 166 may be provided (where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 176

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 166} \end{matrix}$

Accordingly, the poor reception points for s1 and s2 become as in FIG. 32. (In FIG. 32, the horizontal axis is the real axis, and the vertical axis is the imaginary axis.) Instead of Equations 165 and 166, Equations 167 and 168 may be provided (where i=0, 1, 2, 3, and where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 177

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;{({- \frac{i\;\pi}{4}})}} & e^{j{({{- \frac{i\;\pi}{4}} + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 167} \end{matrix}$ Math 178

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 168} \end{matrix}$

Next, a precoding hopping method using a non-unitary matrix is described.

Based on Equation 148, the precoding matrices presently under consideration are represented as follows.

Math 179

$\begin{matrix} {{F(p)} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 169} \end{matrix}$

Equations corresponding to Equations 151 and 152 are represented as follows.

Math 180

$\begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {Ae}^{j\; 0} & q \\ {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} + {n(p)}}} & {{Equation}\mspace{14mu} 170} \end{matrix}$ Math 181

$\begin{matrix} {\begin{pmatrix} {y_{1}(p)} \\ {y_{2}(p)} \end{pmatrix} = {{\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} \\ e^{j\; 0} \end{pmatrix}\begin{pmatrix} {Ae}^{j\; 0} & q \end{pmatrix}\begin{pmatrix} e^{j\;{\theta_{11}{(p)}}} & {\alpha \times e^{j{({{\theta_{11}{(p)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(p)}}}} & e^{j{({{\theta_{21}{(p)}} + \lambda + \delta})}} \end{pmatrix}\begin{pmatrix} {s\; 1(p)} \\ {s\; 2(p)} \end{pmatrix}} + {n(p)}}} & {{Equation}\mspace{14mu} 171} \end{matrix}$

In this case, there are two q at which the minimum value d_(min) ² of the Euclidian distance between a received signal point and a received candidate signal point is zero.

In Equation 171, when s1(p) does not exist:

Math 182

$\begin{matrix} {q = {{- \frac{A}{\alpha}}e^{j{({{\theta_{11}{(p)}} - {\theta_{21}{(p)}}})}}}} & {{Equation}\mspace{14mu} 172} \end{matrix}$

In Equation 171, when s2(p) does not exist:

Math 183 q=−Aα _(e) ^(j(θ) ¹¹ ^((p)−θ) ²¹ ^((p)−δ))  Equation 173

In the precoding hopping method for an N-slot time period (cycle), by referring to Equation 169, N varieties of the precoding matrix F[i] are represented as follows.

Math 184

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{\lbrack i\rbrack}}}} & e^{j{({{\theta_{21}{\lbrack i\rbrack}} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 174} \end{matrix}$

In this equation, let α and δ not change over time. At this point, based on Equations 34 and 35, design conditions such as the following are provided for the precoding matrices for precoding hopping.

Math 185

Condition #14

$\begin{matrix} {{e^{j{({{\theta_{11}{\lbrack x\rbrack}} - {\theta_{21}{\lbrack x\rbrack}}})}} \neq e^{j{({{\theta_{11}{\lbrack y\rbrack}} - {\theta_{21}{\lbrack y\rbrack}}})}}}{{{for}\mspace{14mu}{\forall x}},{\forall{y\left( {{{x \neq y};x},{y = 0},1,\ldots\mspace{14mu},{N - 1}} \right)}}}} & {{Equation}\mspace{14mu} 175} \end{matrix}$ Math 186 Condition #15

$\begin{matrix} {{e^{j{({{\theta_{11}{\lbrack x\rbrack}} - {\theta_{21}{\lbrack x\rbrack}} - \delta})}} \neq e^{j{({{\theta_{11}{\lbrack y\rbrack}} - {\theta_{21}{\lbrack y\rbrack}} - \delta})}}}{{{for}\mspace{14mu}{\forall x}},{\forall{y\left( {{{x \neq y};x},{y = 0},1,\ldots\mspace{14mu},{N - 1}} \right)}}}} & {{Equation}\mspace{14mu} 176} \end{matrix}$ (Example #7)

Let α=1.0 in the precoding matrix in Equation 174. Let the number of slots N in the time period (cycle) be 16. In order to satisfy Condition #12, Condition #14, and Condition #15, precoding matrices for a precoding hopping method with an N=16 time period (cycle) are provided as in the following equations.

For i=0, 1, . . . , 7:

Math 187

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;\frac{i\;\pi}{4}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 177} \end{matrix}$

For i=8, 9, . . . , 15:

Math 188

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;\frac{i\;\pi}{4}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \\ e^{j\; 0} & e^{j\; 0} \end{pmatrix}}} & {{Equation}\mspace{14mu} 178} \end{matrix}$

Furthermore, a precoding matrix that differs from Equations 177 and 178 can be provided as follows.

For i=0, 1, . . . , 7:

Math 189

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 179} \end{matrix}$

For i=8, 9, . . . , 15:

Math 190

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 180} \end{matrix}$

Accordingly, the poor reception points for s1 and s2 become as in FIGS. 33A and 33B.

(In FIGS. 33A and 33B, the horizontal axis is the real axis, and the vertical axis is the imaginary axis.) Instead of Equations 177 and 178, and Equations 179 and 180, precoding matrices may be provided as below.

For i=0, 1, . . . , 7:

Math 191

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;{({- \frac{i\;\pi}{4}})}} & e^{j{({{- \frac{i\;\pi}{4}} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 181} \end{matrix}$

For i=8, 9, . . . , 15:

Math 192

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{({- \frac{i\;\pi}{4}})}} & e^{j{({{- \frac{i\;\pi}{4}} + \frac{7\;\pi}{8}})}} \\ e^{j\; 0} & e^{j\; 0} \end{pmatrix}}} & {{Equation}\mspace{14mu} 182} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 193

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 183} \end{matrix}$

For i=8, 9, . . . , 15:

Math 194

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 184} \end{matrix}$

(In Equations 177-184, 7π/8 may be changed to −7π/8.)

Next, the following is established as a condition, different from Condition #12, for providing fair data reception quality insofar as possible for Γ terminals in the same LOS environment in which only the phase of q differs.

Condition #16

When using a precoding hopping method with an N-slot time period (cycle), the following condition is set:

Math 195 e ^(j(θ) ¹¹ ^([x]−θ) ²¹ ^([x])) ≠e ^(j(θ) ¹¹ ^([y]−θ) ²¹ ^([y]−δ)) for ∀x,∀y(x,y=0,1, . . . ,N−1)  Equation 185

and the poor reception points for s1 and the poor reception points for s2 are arranged to be in an even distribution with respect to phase in the N slots in the time period (cycle).

The following describes an example of a precoding matrix in the precoding hopping method based on Condition #14, Condition #15, and Condition #16. Let α=1.0 in the precoding matrix in Equation 174.

(Example #8)

Let the number of slots N in the time period (cycle) be 8. Precoding matrices for a precoding hopping method with an N=8 time period (cycle) are provided as in the following equation.

Math 196

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;\frac{i\;\pi}{4}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 186} \end{matrix}$

Here, i=0, 1, . . . , 7.

Furthermore, a precoding matrix that differs from Equation 186 can be provided as follows (where i=0, 1, . . . , 7, and where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 197

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 187} \end{matrix}$

Accordingly, the poor reception points for s1 and s2 become as in FIG. 34. Instead of Equations 186 and 187, precoding matrices may be provided as follows (where i=0, 1, . . . , 7, and where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 198

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & e^{j\; 0} \\ e^{j\;{({- \frac{i\;\pi}{4}})}} & e^{j{({{- \frac{i\;\pi}{4}} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 188} \end{matrix}$

or

Math 199

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}} \\ e^{j\;{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 189} \end{matrix}$

(In Equations 186-189, 7π/8 may be changed to −7π/8.)

Next, in the precoding matrix of Equation 174, a precoding hopping method that differs from Example #7 and Example #8 by letting α≠1, and by taking into consideration the distance in the complex plane between poor reception points, is examined.

In this case, the precoding hopping method for an N-slot time period (cycle) of Equation 174 is used, and from Condition #14, in all of the Γ terminals, there is one slot or less having poor reception points for s1 among the N slots in a time period (cycle). Accordingly, the log-likelihood ratio for bits transmitted by s1(p) can be obtained for at least N−1 slots. Similarly, from Condition #15, in all of the Γ terminals, there is one slot or less having poor reception points for s2 among the N slots in a time period (cycle). Accordingly, the log-likelihood ratio for bits transmitted by s2(p) can be obtained for at least N−1 slots.

Therefore, it is clear that a larger value for N in the N-slot time period (cycle) increases the number of slots in which the log-likelihood ratio can be obtained.

Incidentally, since the influence of scattered wave components is also present in an actual channel model, it is considered that when the number of slots N in the time period (cycle) is fixed, there is a possibility of improved data reception quality if the minimum distance in the complex plane between poor reception points is as large as possible. Accordingly, in the context of Example #7 and Example #8, precoding hopping methods in which α≠1 and which improve on Example #7 and Example #8 are considered. The precoding method that improves on Example #8 is easier to understand and is therefore described first.

Example #9

From Equation 186, the precoding matrices in an N=8 time period (cycle) precoding hopping method that improves on Example #8 are provided in the following equation.

Math 200

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 190} \end{matrix}$

Here, i=0, 1, . . . , 7. Furthermore, precoding matrices that differ from Equation 190 can be provided as follows (where i=0, 1, . . . , 7, and where λ and θ₁₁[i] do not change over time (though change may be allowed)).

Math 201

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 191} \end{matrix}$

or

Math 202

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j{({{- \frac{i\;\pi}{4}} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 192} \end{matrix}$

or

Math 203

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 193} \end{matrix}$

or

Math 204

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j{({\frac{i\;\pi}{4} - \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 194} \end{matrix}$

or

Math 205

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda - \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 195} \end{matrix}$

or

Math 206

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j{({{- \frac{i\;\pi}{4}} - \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 196} \end{matrix}$

or

Math 207

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda - \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 197} \end{matrix}$

Therefore, the poor reception points for s1 and s2 are represented as in FIG. 35A when α<1.0 and as in FIG. 35B when α>1.0.

(i) When α<1.0

When α<1.0, the minimum distance in the complex plane between poor reception points is represented as min{d_(#1,#2), d_(#1,#3)} when focusing on the distance (d_(#1,#2)) between poor reception points #1 and #2 and the distance (d_(#1,#3)) between poor reception points #1 and #3. In this case, the relationship between α and d_(#1,#2) and between α and d_(#1,#3) is shown in FIG. 36. The α which makes min{d_(#1,#2), d_(#1,#3)} the largest is as follows.

Math 208

$\begin{matrix} \begin{matrix} {\alpha = \frac{1}{\sqrt{{\cos\left( \frac{\pi}{8} \right)} + {\sqrt{3}{\sin\left( \frac{\pi}{8} \right)}}}}} \\ {\approx 0.7938} \end{matrix} & {{Equation}\mspace{11mu} 198} \end{matrix}$

The min{d_(#1,#2), d_(#1,#3)} in this case is as follows.

Math 209

$\begin{matrix} {\min\left\{ {d_{{\# 1},{\# 2}},d_{{\# 1},{\# 3}}} \right\}\begin{matrix} {= \frac{2\; A\;{\sin\left( \frac{\pi}{8} \right)}}{\sqrt{{\cos\left( \frac{\pi}{8} \right)} + {\sqrt{3}{\sin\left( \frac{\pi}{8} \right)}}}}} \\ {\approx {0.6076A}} \end{matrix}} & {{Equation}\mspace{14mu} 199} \end{matrix}$

Therefore, the precoding method using the value of α in Equation 198 for Equations 190-197 is effective. Setting the value of α as in Equation 198 is one appropriate method for obtaining excellent data reception quality. Setting α to be a value near Equation 198, however, may similarly allow for excellent data reception quality. Accordingly, the value to which α is set is not limited to Equation 198.

(ii) When α>1.0

When α>1.0, the minimum distance in the complex plane between poor reception points is represented as min{d_(#4,#5), d_(#4,#6)} when focusing on the distance (d_(#4,#5)) between poor reception points #4 and #5 and the distance (d_(#4,#6)) between poor reception points #4 and #6. In this case, the relationship between α and d_(#4,#5) and between α and d_(#4,#6) is shown in FIG. 37. The α which makes min{d_(#4,#5), d_(#4,#6)} the largest is as follows.

Math 210

$\begin{matrix} \begin{matrix} {\alpha = \sqrt{{\cos\left( \frac{\pi}{8} \right)} + {\sqrt{3}{\sin\left( \frac{\pi}{8} \right)}}}} \\ {\approx 1.2596} \end{matrix} & {{Equation}\mspace{11mu} 200} \end{matrix}$

The min{d_(#4,#5), d_(#4,#6)} in this case is as follows.

Math 211

$\begin{matrix} {\min\left\{ {d_{{\# 4},{\# 5}},d_{{\# 4},{\# 6}}} \right\}\begin{matrix} {= \frac{2\; A\;{\sin\left( \frac{\pi}{8} \right)}}{\sqrt{{\cos\left( \frac{\pi}{8} \right)} + {\sqrt{3}{\sin\left( \frac{\pi}{8} \right)}}}}} \\ {\approx {0.6076A}} \end{matrix}} & {{Equation}\mspace{14mu} 201} \end{matrix}$

Therefore, the precoding method using the value of α in Equation 200 for Equations 190-197 is effective. Setting the value of α as in Equation 200 is one appropriate method for obtaining excellent data reception quality. Setting α to be a value near Equation 200, however, may similarly allow for excellent data reception quality. Accordingly, the value to which α is set is not limited to Equation 200.

(Example #10)

Based on consideration of Example #9, the precoding matrices in an N=16 time period (cycle) precoding hopping method that improves on Example #7 are provided in the following equations (where λ and θ₁₁[i] do not change over time (though change may be allowed)).

For i=0, 1, . . . , 7:

Math 212

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 202} \end{matrix}$

For i=8, 9, . . . , 15:

Math 213

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j{({\frac{i\;\pi}{4} + \frac{7\;\pi}{8}})}} \\ e^{j\; 0} & {\alpha \times e^{j\; 0}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 203} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 214

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 204} \end{matrix}$

For i=8, 9, . . . , 15:

Math 215

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 205} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 216

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j\;{({{- \frac{i\;\pi}{4}} + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 206} \end{matrix}$

For i=8, 9, . . . , 15:

Math 217

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j\;{({{- \frac{i\;\pi}{4}} + \frac{7\pi}{8}})}} \\ e^{j\; 0} & {\alpha \times e^{j\; 0}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 207} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 218

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 208} \end{matrix}$

For i=8, 9, . . . , 15:

Math 219

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda + \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 209} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 220

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;{(\frac{i\;\pi}{4})}}} & e^{j\;{({\frac{i\;\pi}{4} - \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 210} \end{matrix}$

For i=8, 9, . . . , 15:

Math 221

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{(\frac{i\;\pi}{4})}}} & e^{j\;{({\frac{i\;\pi}{4} - \frac{7\pi}{8}})}} \\ e^{j\; 0} & {\alpha \times e^{j\; 0}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 211} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 222

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda - \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 212} \end{matrix}$

For i=8, 9, . . . , 15:

Math 223

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \frac{i\;\pi}{4} + \lambda - \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 213} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 224

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j\;{({{- \frac{i\;\pi}{4}} - \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 214} \end{matrix}$

For i=8, 9, . . . , 15:

Math 225

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{({- \frac{i\;\pi}{4}})}}} & e^{j\;{({{- \frac{i\;\pi}{4}} - \frac{7\pi}{8}})}} \\ e^{j\; 0} & {\alpha \times e^{j\; 0}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 215} \end{matrix}$

or

For i=0, 1, . . . , 7:

Math 226

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda - \frac{7\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 216} \end{matrix}$

For i=8, 9, . . . , 15:

Math 227

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4}})}}} & e^{j{({{\theta_{11}{\lbrack i\rbrack}} - \frac{i\;\pi}{4} + \lambda - \frac{7\pi}{8}})}} \\ e^{j\;{\theta_{11}{\lbrack i\rbrack}}} & {\alpha \times e^{j{({{\theta_{11}{\lbrack i\rbrack}} + \lambda})}}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 217} \end{matrix}$

The value of α in Equation 198 and in Equation 200 is appropriate for obtaining excellent data reception quality. The poor reception points for s1 are represented as in FIGS. 38A and 38B when α<1.0 and as in FIGS. 39A and 39B when α>1.0.

In the present embodiment, the method of structuring N different precoding matrices for a precoding hopping method with an N-slot time period (cycle) has been described. In this case, as the N different precoding matrices, F[0], F[1], F[2], . . . , F[N−2], F[N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[N−2], F[N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the N different precoding matrices F[0], F[1], F[2], . . . , F[N−2], F[N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with an N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using N different precoding matrices. In other words, the N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Examples #5 through #10 have been shown based on Conditions #10 through #16. However, in order to achieve a precoding matrix hopping method with a longer period (cycle), the period (cycle) for hopping between precoding matrices may be lengthened by, for example, selecting a plurality of examples from Examples #5 through #10 and using the precoding matrices indicated in the selected examples. For example, a precoding matrix hopping method with a longer period (cycle) may be achieved by using the precoding matrices indicated in Example #7 and the precoding matrices indicated in Example #10. In this case, Conditions #10 through #16 are not necessarily observed. (In Equation 158 of Condition #10, Equation 159 of Condition #11, Equation 164 of Condition #13, Equation 175 of Condition #14, and Equation 176 of Condition #15, it becomes important for providing excellent reception quality for the conditions “all x and all y” to be “existing x and existing y”.) When viewed from a different perspective, in the precoding matrix hopping method over an N-slot period (cycle) (where N is a large natural number), the probability of providing excellent reception quality increases when the precoding matrices of one of Examples #5 through #10 are included.

Embodiment 7

The present embodiment describes the structure of a reception device for receiving modulated signals transmitted by a transmission method that regularly hops between precoding matrices as described in Embodiments 1-6.

In Embodiment 1, the following method has been described. A transmission device that transmits modulated signals, using a transmission method that regularly hops between precoding matrices, transmits information regarding the precoding matrices. Based on this information, a reception device obtains information on the regular precoding matrix hopping used in the transmitted frames, decodes the precoding, performs detection, obtains the log-likelihood ratio for the transmitted bits, and subsequently performs error correction decoding.

The present embodiment describes the structure of a reception device, and a method of hopping between precoding matrices, that differ from the above structure and method.

FIG. 40 is an example of the structure of a transmission device in the present embodiment. Elements that operate in a similar way to FIG. 3 bear the same reference signs. An encoder group (4002) receives transmission bits (4001) as input. The encoder group (4002), as described in Embodiment 1, includes a plurality of encoders for error correction coding, and based on the frame structure signal 313, a certain number of encoders operate, such as one encoder, two encoders, or four encoders.

When one encoder operates, the transmission bits (4001) are encoded to yield encoded transmission bits. The encoded transmission bits are allocated into two parts, and the encoder group (4002) outputs allocated bits (4003A) and allocated bits (4003B).

When two encoders operate, the transmission bits (4001) are divided in two (referred to as divided bits A and B). The first encoder receives the divided bits A as input, encodes the divided bits A, and outputs the encoded bits as allocated bits (4003A). The second encoder receives the divided bits B as input, encodes the divided bits B, and outputs the encoded bits as allocated bits (4003B).

When four encoders operate, the transmission bits (4001) are divided in four (referred to as divided bits A, B, C, and D). The first encoder receives the divided bits A as input, encodes the divided bits A, and outputs the encoded bits A. The second encoder receives the divided bits B as input, encodes the divided bits B, and outputs the encoded bits B. The third encoder receives the divided bits C as input, encodes the divided bits C, and outputs the encoded bits C. The fourth encoder receives the divided bits D as input, encodes the divided bits D, and outputs the encoded bits D. The encoded bits A, B, C, and D are divided into allocated bits (4003A) and allocated bits (4003B).

The transmission device supports a transmission method such as, for example, the following Table 1 (Table 1A and Table 1B).

TABLE 1A Number of modulated transmission Pre- signals Error Trans- coding (number Number correction mission matrix of transmit Modulation of en- coding infor- hopping antennas) method coders method mation method 1 QPSK 1 A 00000000 — B 00000001 — C 00000010 —  16 QAM 1 A 00000011 — B 00000100 — C 00000101 —  64 QAM 1 A 00000110 — B 00000111 — C 00001000 —  256 QAM 1 A 00001001 — B 00001010 — C 00001011 — 1024 QAM 1 A 00001100 — B 00001101 — C 00001110 —

TABLE 1B Number of modulated transmission Pre- signals Error Trans- coding (number Number correction mission matrix of transmit Modulation of en- coding infor- hopping antennas) method coders method mation method 2 #1: QPSK, 1 A 00001111 D #2: QPSK B 00010001 D C 00010001 D 2 A 00010010 E B 00010011 E C 00010100 E #1: QPSK, 1 A 00010101 D #2: B 00010110 D 16 QAM C 00010111 D 2 A 00011000 E B 00011001 E C 00011010 E #1: 1 A 00011011 D 16 QAM, B 00011100 D #2: C 00011101 D 16 QAM 2 A 00011110 E B 00011111 E C 00100000 E #1: 1 A 00100001 D 16 QAM, B 00100010 D #2: C 00100011 D 64 QAM 2 A 00100100 E B 00100101 E C 00100110 E #1: 1 A 00100111 F 64 QAM, B 00101000 F #2: C 00101001 F 64 QAM 2 A 00101010 G B 00101011 G C 00101100 G #1: 1 A 00101101 F 64 QAM, B 00101110 F #2: C 00101111 F 256 QAM 2 A 00110000 G B 00110001 G C 00110010 G #1: 1 A 00110011 F 256 QAM, B 00110100 F #2: C 00110101 F 256 QAM 2 A 00110110 G B 00110111 G C 00111000 G 4 A 00111001 H B 00111010 H C 00111011 H #1: 1 A 00111100 F 256 QAM, B 00111101 F #2: C 00111110 F 1024 QAM 2 A 00111111 G B 01000000 G C 01000001 G 4 A 01000010 H B 01000011 H C 01000100 H #1: 1 A 01000101 F 1024 QAM, B 01000110 F #2: C 01000111 F 1024 QAM 2 A 01001000 G B 01001001 G C 01001010 G 4 A 01001011 H B 01001100 H C 01001101 H

As shown in Table 1, transmission of a one-stream signal and transmission of a two-stream signal are supported as the number of transmission signals (number of transmit antennas). Furthermore, QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM are supported as the modulation method. In particular, when the number of transmission signals is two, it is possible to set separate modulation methods for stream #1 and stream #2. For example, “#1: 256QAM, #2: 1024QAM” in Table 1 indicates that “the modulation method of stream #1 is 256QAM, and the modulation method of stream #2 is 1024QAM” (other entries in the table are similarly expressed). Three types of error correction coding methods, A, B, and C, are supported. In this case, A, B, and C may all be different coding methods. A, B, and C may also be different coding rates, and A, B, and C may be coding methods with different block sizes.

The pieces of transmission information in Table 1 are allocated to modes that define a “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method”. Accordingly, in the case of “number of transmission signals: 2”, “modulation method: #1: 1024QAM, #2: 1024QAM”, “number of encoders: 4”, and “error correction coding method: C”, for example, the transmission information is set to 01001101. In the frame, the transmission device transmits the transmission information and the transmission data. When transmitting the transmission data, in particular when the “number of transmission signals” is two, a “precoding matrix hopping method” is used in accordance with Table 1. In Table 1, five types of the “precoding matrix hopping method”, D, E, F, G, and H, are prepared. The precoding matrix hopping method is set to one of these five types in accordance with Table 1. The following, for example, are ways of implementing the five different types.

-   -   Prepare five different precoding matrices.     -   Use five different types of periods (cycles), for example a         four-slot period (cycle) for D, an eight-slot period (cycle) for         E, . . . .     -   Use both different precoding matrices and different periods         (cycles).

FIG. 41 shows an example of a frame structure of a modulated signal transmitted by the transmission device in FIG. 40. The transmission device is assumed to support settings for both a mode to transmit two modulated signals, z1(t) and z2(t), and for a mode to transmit one modulated signal.

In FIG. 41, the symbol (4100) is a symbol for transmitting the “transmission information” shown in Table 1. The symbols (4101_1) and (4101_2) are reference (pilot) symbols for channel estimation. The symbols (4102_1, 4103_1) are data transmission symbols for transmitting the modulated signal z1(t). The symbols (4102_2, 4103_2) are data transmission symbols for transmitting the modulated signal z2(t). The symbol (4102_1) and the symbol (4102_2) are transmitted at the same time along the same (shared/common) frequency, and the symbol (4103_1) and the symbol (4103_2) are transmitted at the same time along the same (shared/common) frequency. The symbols (4102_1, 4103_1) and the symbols (4102_2, 4103_2) are the symbols after precoding matrix calculation using the method of regularly hopping between precoding matrices described in Embodiments 1-4 and Embodiment 6 (therefore, as described in Embodiment 1, the structure of the streams s1(t) and s2(t) is as in FIG. 6).

Furthermore, in FIG. 41, the symbol (4104) is a symbol for transmitting the “transmission information” shown in Table 1. The symbol (4105) is a reference (pilot) symbol for channel estimation. The symbols (4106, 4107) are data transmission symbols for transmitting the modulated signal z1(t). The data transmission symbols for transmitting the modulated signal z1(t) are not precoded, since the number of transmission signals is one.

Accordingly, the transmission device in FIG. 40 generates and transmits modulated signals in accordance with Table 1 and the frame structure in FIG. 41. In FIG. 40, the frame structure signal 313 includes information regarding the “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method” set based on Table 1. The encoder (4002), the mappers 306A, B, and the weighting units 308A, B receive the frame structure signal as an input and operate based on the “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method” that are set based on Table 1. “Transmission information” corresponding to the set “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method” is also transmitted to the reception device.

The structure of the reception device may be represented similarly to FIG. 7 of Embodiment 1. The difference with Embodiment 1 is as follows: since the transmission device and the reception device store the information in Table 1 in advance, the transmission device does not need to transmit information for regularly hopping between precoding matrices, but rather transmits “transmission information” corresponding to the “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method”, and the reception device obtains information for regularly hopping between precoding matrices from Table 1 by receiving the “transmission information”. Accordingly, by the control information decoding unit 709 obtaining the “transmission information” transmitted by the transmission device in FIG. 40, the reception device in FIG. 7 obtains, from the information corresponding to Table 1, a signal 710 regarding information on the transmission method, as notified by the transmission device, which includes information for regularly hopping between precoding matrices. Therefore, when the number of transmission signals is two, the signal processing unit 711 can perform detection based on a precoding matrix hopping pattern to obtain received log-likelihood ratios.

Note that in the above description, “transmission information” is set with respect to the “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method” as in Table 1, and the precoding matrix hopping method is set with respect to the “transmission information”. However, it is not necessary to set the “transmission information” with respect to the “number of transmission signals”, “modulation method”, “number of encoders”, and “error correction coding method”. For example, as in Table 2, the “transmission information” may be set with respect to the “number of transmission signals” and “modulation method”, and the precoding matrix hopping method may be set with respect to the “transmission information”.

TABLE 2 Number of modulated trans- Precoding mission signals matrix (number of Modulation Transmission hopping transmit antennas) method information method 1 QPSK 00000 — 16 QAM 00001 — 64 QAM 00010 — 256 QAM 00011 — 1024 QAM 00100 — 2 #1: QPSK, 10000 D #2: QPSK #1: QPSK, 10001 E #2: 16 QAM #1: 16 QAM, 10010 E #2: 16 QAM #1: 16 QAM, 10011 E #2: 64 QAM #1: 64 QAM, 10100 F #2: 64 QAM #1: 64 QAM, 10101 F #2: 256 QAM #1: 256 QAM, 10110 G #2: 256 QAM #1: 256 QAM, 10111 G #2: 1024 QAM #1: 1024 QAM, 11000 H #2: 1024 QAM

In this context, the “transmission information” and the method of setting the precoding matrix hopping method is not limited to Tables 1 and 2. As long as a rule is determined in advance for switching the precoding matrix hopping method based on transmission parameters, such as the “number of transmission signals”, “modulation method”, “number of encoders”, “error correction coding method”, or the like (as long as the transmission device and the reception device share a predetermined rule, or in other words, if the precoding matrix hopping method is switched based on any of the transmission parameters (or on any plurality of transmission parameters)), the transmission device does not need to transmit information regarding the precoding matrix hopping method. The reception device can identify the precoding matrix hopping method used by the transmission device by identifying the information on the transmission parameters and can therefore accurately perform decoding and detection. Note that in Tables 1 and 2, a transmission method that regularly hops between precoding matrices is used when the number of modulated transmission signals is two, but a transmission method that regularly hops between precoding matrices may be used when the number of modulated transmission signals is two or greater.

Accordingly, if the transmission device and reception device share a table regarding transmission patterns that includes information on precoding hopping methods, the transmission device need not transmit information regarding the precoding hopping method, transmitting instead control information that does not include information regarding the precoding hopping method, and the reception device can infer the precoding hopping method by acquiring this control information.

As described above, in the present embodiment, the transmission device does not transmit information directly related to the method of regularly hopping between precoding matrices. Rather, a method has been described wherein the reception device infers information regarding precoding for the “method of regularly hopping between precoding matrices” used by the transmission device. This method yields the advantageous effect of improved transmission efficiency of data as a result of the transmission device not transmitting information directly related to the method of regularly hopping between precoding matrices.

Note that the present embodiment has been described as changing precoding weights in the time domain, but as described in Embodiment 1, the present invention may be similarly embodied when using a multi-carrier transmission method such as OFDM or the like.

In particular, when the precoding hopping method only changes depending on the number of transmission signals, the reception device can learn the precoding hopping method by acquiring information, transmitted by the transmission device, on the number of transmission signals.

In the present description, it is considered that a communications/broadcasting device such as a broadcast station, a base station, an access point, a terminal, a mobile phone, or the like is provided with the transmission device, and that a communications device such as a television, radio, terminal, personal computer, mobile phone, access point, base station, or the like is provided with the reception device. Additionally, it is considered that the transmission device and the reception device in the present description have a communications function and are capable of being connected via some sort of interface to a device for executing applications for a television, radio, personal computer, mobile phone, or the like.

Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, postamble, reference symbol, and the like), symbols for control information, and the like may be arranged in the frame in any way. While the terms “pilot symbol” and “symbols for control information” have been used here, any term may be used, since the function itself is what is important.

It suffices for a pilot symbol, for example, to be a known symbol modulated with PSK modulation in the transmission and reception devices (or for the reception device to be able to synchronize in order to know the symbol transmitted by the transmission device). The reception device uses this symbol for synchronization of frequency, synchronization of time, channel estimation (estimation of Channel State Information (CSI) for each modulated signal), detection of signals, and the like.

A symbol for control information is for transmitting information other than data (of applications or the like) that needs to be transmitted to the communication partner for achieving communication (for example, the modulation method, error correction coding method, coding rate of the error correction coding method, setting information in the upper layer, and the like).

Note that the present invention is not limited to the above Embodiments 1-5 and may be embodied with a variety of modifications. For example, the above embodiments describe communications devices, but the present invention is not limited to these devices and may be implemented as software for the corresponding communications method.

Furthermore, a precoding hopping method used in a method of transmitting two modulated signals from two antennas has been described, but the present invention is not limited in this way. The present invention may be also embodied as a precoding hopping method for similarly changing precoding weights (matrices) in the context of a method whereby four mapped signals are precoded to generate four modulated signals that are transmitted from four antennas, or more generally, whereby N mapped signals are precoded to generate N modulated signals that are transmitted from N antennas.

In the description, terms such as “precoding” and “precoding weight” are used, but any other terms may be used. What matters in the present invention is the actual signal processing.

Different data may be transmitted in streams s1(t) and s2(t), or the same data may be transmitted.

Each of the transmit antennas of the transmission device and the receive antennas of the reception device shown in the figures may be formed by a plurality of antennas.

Programs for executing the above transmission method may, for example, be stored in advance in Read Only Memory (ROM) and be caused to operate by a Central Processing Unit (CPU).

Furthermore, the programs for executing the above transmission method may be stored in a computer-readable recording medium, the programs stored in the recording medium may be loaded in the Random Access Memory (RAM) of the computer, and the computer may be caused to operate in accordance with the programs.

The components in the above embodiments may be typically assembled as a Large Scale Integration (LSI), a type of integrated circuit. Individual components may respectively be made into discrete chips, or part or all of the components in each embodiment may be made into one chip. While an LSI has been referred to, the terms Integrated Circuit (IC), system LSI, super LSI, or ultra LSI may be used depending on the degree of integration. Furthermore, the method for assembling integrated circuits is not limited to LSI, and a dedicated circuit or a general-purpose processor may be used. A Field Programmable Gate Array (FPGA), which is programmable after the LSI is manufactured, or a reconfigurable processor, which allows reconfiguration of the connections and settings of circuit cells inside the LSI, may be used.

Furthermore, if technology for forming integrated circuits that replaces LSIs emerges, owing to advances in semiconductor technology or to another derivative technology, the integration of functional blocks may naturally be accomplished using such technology. The application of biotechnology or the like is possible.

Embodiment 8

The present embodiment describes an application of the method described in Embodiments 1-4 and Embodiment 6 for regularly hopping between precoding weights.

FIG. 6 relates to the weighting method (precoding method) in the present embodiment. The weighting unit 600 integrates the weighting units 308A and 308B in FIG. 3. As shown in FIG. 6, the stream s1(t) and the stream s2(t) correspond to the baseband signals 307A and 307B in FIG. 3. In other words, the streams s1(t) and s2(t) are the baseband signal in-phase components I and quadrature-phase components Q when mapped according to a modulation scheme such as QPSK, 16QAM, 64QAM, or the like. As indicated by the frame structure of FIG. 6, the stream s1(t) is represented as s1(u) at symbol number u, as s1(u+1) at symbol number u+1, and so forth. Similarly, the stream s2(t) is represented as s2(u) at symbol number u, as s2(u+1) at symbol number u+1, and so forth. The weighting unit 600 receives the baseband signals 307A (s1(t)) and 307B (s2(t)) and the information 315 regarding weighting information in FIG. 3 as inputs, performs weighting in accordance with the information 315 regarding weighting, and outputs the signals 309A (z1(t)) and 309B (z2(t)) after weighting in FIG. 3.

At this point, when for example a precoding matrix hopping method with an N=8 period (cycle) as in Example #8 in Embodiment 6 is used, z1(t) and z2(t) are represented as follows.

For symbol number 8i (where i is an integer greater than or equal to zero):

Math 228

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {8i} \right)} \\ {z\; 2\left( {8i} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j\;{({\frac{k\;\pi}{4} + \frac{7\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {8i} \right)} \\ {s\; 2\left( {8i} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 218} \end{matrix}$

Here, j is an imaginary unit, and k=0.

For symbol number 8i+1:

Math 229

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8i} + 1} \right)} \\ {z\; 2\left( {{8i} + 1} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\;\frac{i\;\pi}{4}}} & e^{j\;{({\frac{k\;\pi}{4} + \frac{7\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 1} \right)} \\ {s\; 2\left( {{8i} + 1} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 219} \end{matrix}$

Here, k=1.

For symbol number 8i+2:

Math 230

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 2} \right)} \\ {z\; 2\left( {{8\; i} + 2} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 2} \right)} \\ {s\; 2\left( {{8\; i} + 2} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 220} \end{matrix}$

Here, k=2.

For symbol number 8i+3:

Math 231

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 3} \right)} \\ {z\; 2\left( {{8\; i} + 3} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 3} \right)} \\ {s\; 2\left( {{8\; i} + 3} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 221} \end{matrix}$

Here, k=3.

For symbol number 8i+4:

Math 232

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 4} \right)} \\ {z\; 2\left( {{8\; i} + 4} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 4} \right)} \\ {s\; 2\left( {{8\; i} + 4} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 222} \end{matrix}$

Here, k=4.

For symbol number 8i+5:

Math 233

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 5} \right)} \\ {z\; 2\left( {{8\; i} + 5} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 5} \right)} \\ {s\; 2\left( {{8\; i} + 5} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 223} \end{matrix}$

Here, k=5.

For symbol number 8i+6:

Math 234

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 6} \right)} \\ {z\; 2\left( {{8\; i} + 6} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 6} \right)} \\ {s\; 2\left( {{8\; i} + 6} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 224} \end{matrix}$

Here, k=6.

For symbol number 8i+7:

Math 235

$\begin{matrix} {\begin{pmatrix} {z\; 1\left( {{8\; i} + 7} \right)} \\ {z\; 2\left( {{8\; i} + 7} \right)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j\frac{i\;\pi}{4}}} & e^{j{({\frac{k\;\pi}{4} + \frac{7\;\pi}{8}})}} \end{pmatrix}\begin{pmatrix} {s\; 1\left( {{8i} + 7} \right)} \\ {s\; 2\left( {{8\; i} + 7} \right)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 225} \end{matrix}$

Here, k=7.

The symbol numbers shown here can be considered to indicate time. As described in other embodiments, in Equation 225, for example, z1(8i+7) and z2(8i+7) at time 8i+7 are signals at the same time, and the transmission device transmits z1(8i+7) and z2(8i+7) over the same (shared/common) frequency. In other words, letting the signals at time T be s1(T), s2(T), z1(T), and z2(T), then z1(T) and z2(T) are sought from some sort of precoding matrices and from s1(T) and s2(T), and the transmission device transmits z1(T) and z2(T) over the same (shared/common) frequency (at the same time). Furthermore, in the case of using a multi-carrier transmission method such as OFDM or the like, and letting signals corresponding to s1, s2, z1, and z2 for (sub)carrier L and time T be s1(T, L), s2(T, L), z1(T, L), and z2(T, L), then z1(T, L) and z2(T, L) are sought from some sort of precoding matrices and from s1(T, L) and s2(T, L), and the transmission device transmits z1(T, L) and z2(T, L) over the same (shared/common) frequency (at the same time).

In this case, the appropriate value of a is given by Equation 198 or Equation 200.

The present embodiment describes a precoding hopping method that increases period (cycle) size, based on the above-described precoding matrices of Equation 190.

Letting the period (cycle) of the precoding hopping method be 8M, 8M different precoding matrices are represented as follows.

Math 236

$\begin{matrix} {{F\left\lbrack {{8 \times k} + i} \right\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j{({\frac{i\;\pi}{4} + \frac{k\;\pi}{4\; M}})}}} & e^{j{({\frac{i\;\pi}{4} + \frac{k\;\pi}{4\; M} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 226} \end{matrix}$

In this case, i=0, 1, 2, 3, 4, 5, 6, 7, and k=0, 1, . . . , M−2, M−1.

For example, letting M=2 and α<1, the poor reception points for s1 (∘) and for s2 (□) at k=0 are represented as in FIG. 42A. Similarly, the poor reception points for s1 (∘) and for s2 (□) at k=1 are represented as in FIG. 42B. In this way, based on the precoding matrices in Equation 190, the poor reception points are as in FIG. 42A, and by using, as the precoding matrices, the matrices yielded by multiplying each term in the second line on the right-hand side of Equation 190 by e^(jX) (see Equation 226), the poor reception points are rotated with respect to FIG. 42A (see FIG. 42B). (Note that the poor reception points in FIG. 42A and FIG. 42B do not overlap. Even when multiplying by e^(jX), the poor reception points should not overlap, as in this case. Furthermore, the matrices yielded by multiplying each term in the first line on the right-hand side of Equation 190, rather than in the second line on the right-hand side of Equation 190, by e^(jX) may be used as the precoding matrices.) In this case, the precoding matrices F[0]-F[15] are represented as follows.

Math 237

$\begin{matrix} {{F\left\lbrack {{8 \times k} + i} \right\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\; 0} & {\alpha \times e^{j\; 0}} \\ {\alpha \times e^{j{({\frac{i\;\pi}{4} + {X\; k}})}}} & e^{j{({\frac{i\;\pi}{4} + {X\; k} + \frac{7\;\pi}{8}})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 227} \end{matrix}$

Here, i=0, 1, 2, 3, 4, 5, 6, 7, and k=0, 1.

In this case, when M=2, precoding matrices F[0]-F[15] are generated (the precoding matrices F[0]-F[15] may be in any order, and the matrices F[0]-F[15] may each be different). Symbol number 16i may be precoded using F[0], symbol number 16i+1 may be precoded using F[1], . . . , and symbol number 16i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , 14, 15). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.)

Summarizing the above considerations, with reference to Equations 82-85, N-period (cycle) precoding matrices are represented by the following equation.

Math 238

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j{({{\theta_{21}{(i)}} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 228} \end{matrix}$

Here, since the period (cycle) has N slots, i=0, 1, 2, . . . , N−2, N−1. Furthermore, the N×M period (cycle) precoding matrices based on Equation 228 are represented by the following equation.

Math 239

$\begin{matrix} {{F\left\lbrack {{N \times k} + i} \right\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j{({{\theta_{21}{(i)}} + X_{k}})}}} & e^{j{({{\theta_{21}{(i)}} + X_{k} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 229} \end{matrix}$

In this case, i=0, 1, 2, . . . , N−2, N−1, and k=0, 1, . . . , M−2, M−1.

Precoding matrices F[0]-F[N×M−1] are thus generated (the precoding matrices F[0]-F[N×M−1] may be in any order for the N×M slots in the period (cycle)). Symbol number N×M×i may be precoded using F[0], symbol number N×M×i+1 may be precoded using F[1], . . . , and symbol number N×M×i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , N×M−2, N×M−1). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.)

Generating the precoding matrices in this way achieves a precoding matrix hopping method with a large period (cycle), allowing for the position of poor reception points to be easily changed, which may lead to improved data reception quality. Note that while the N×M period (cycle) precoding matrices have been set to Equation 229, the N×M period (cycle) precoding matrices may be set to the following equation, as described above.

Math 240

$\begin{matrix} {{F\left\lbrack {{N \times k} + i} \right\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{({{\theta_{11}{(i)}} + X_{k}})}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + X_{k} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j{({{\theta_{21}{(i)}} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 230} \end{matrix}$

In this case, i=0, 1, 2, . . . , N−2, N−1, and k=0, 1, . . . , M−2, M−1.

In Equations 229 and 230, when 0 radians ≤δ<2π radians, the matrices are a unitary matrix when δ=π radians and are a non-unitary matrix when δ≠π radians. In the present method, use of a non-unitary matrix for π/2 radians ≤|δ|<π radians is one characteristic structure (the conditions for δ being similar to other embodiments), and excellent data reception quality is obtained. Use of a unitary matrix is another structure, and as described in detail in Embodiment 10 and Embodiment 16, if N is an odd number in Equations 229 and 230, the probability of obtaining excellent data reception quality increases.

Embodiment 9

The present embodiment describes a method for regularly hopping between precoding matrices using a unitary matrix.

As described in Embodiment 8, in the method of regularly hopping between precoding matrices over a period (cycle) with N slots, the precoding matrices prepared for the N slots with reference to Equations 82-85 are represented as follows.

Math 241

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j{({{\theta_{21}{(i)}} + \lambda + \delta})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 231} \end{matrix}$

In this case, i=0, 1, 2, . . . , N−2, N−1. (Let α>0.) Since a unitary matrix is used in the present embodiment, the precoding matrices in Equation 231 may be represented as follows.

Math 242

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j{({{\theta_{21}{(i)}} + \lambda + \pi})}} \end{pmatrix}}} & {{Equation}\mspace{14mu} 232} \end{matrix}$

In this case, i=0, 1, 2, . . . , N−2, N−1. (Let α>0.) From Condition #5 (Math 106) and Condition #6 (Math 107) in Embodiment 3, the following condition is important for achieving excellent data reception quality.

Math 243

Condition #17 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 244

Condition #18 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Embodiment 6 describes the distance between poor reception points. In order to increase the distance between poor reception points, it is important for the number of slots N to be an odd number three or greater. The following explains this point.

In order to distribute the poor reception points evenly with regards to phase in the complex plane, as described in Embodiment 6, Condition #19 and Condition #20 are provided.

Math 245

Condition #19

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{(\frac{2\;\pi}{N})}}\mspace{14mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$ Math 246 Condition #20

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{({- \frac{2\;\pi}{N}})}}\mspace{14mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$

In other words, Condition #19 means that the difference in phase is 2π/N radians. On the other hand, Condition #20 means that the difference in phase is −2π/N radians.

Letting θ₁₁(0)−θ₂₁(0)=0 radians, and letting α<1, the distribution of poor reception points for s1 and for s2 in the complex plane for an N=3 period (cycle) is shown in FIG. 43A, and the distribution of poor reception points for s1 and for s2 in the complex plane for an N=4 period (cycle) is shown in FIG. 43B. Letting θ₁₁(0)−θ₂₁(0)=0 radians, and letting α>1, the distribution of poor reception points for s1 and for s2 in the complex plane for an N=3 period (cycle) is shown in FIG. 44A, and the distribution of poor reception points for s1 and for s2 in the complex plane for an N=4 period (cycle) is shown in FIG. 44B.

In this case, when considering the phase between a line segment from the origin to a poor reception point and a half line along the real axis defined by real ≥0 (see FIG. 43A), then for either α>1 or α<1, when N=4, the case always occurs wherein the phase for the poor reception points for s1 and the phase for the poor reception points for s2 are the same value. (See 4301, 4302 in FIG. 43B, and 4401, 4402 in FIG. 44B.) In this case, in the complex plane, the distance between poor reception points becomes small. On the other hand, when N=3, the phase for the poor reception points for s1 and the phase for the poor reception points for s2 are never the same value.

Based on the above, considering how the case always occurs wherein the phase for the poor reception points for s1 and the phase for the poor reception points for s2 are the same value when the number of slots N in the period (cycle) is an even number, setting the number of slots N in the period (cycle) to an odd number increases the probability of a greater distance between poor reception points in the complex plane as compared to when the number of slots N in the period (cycle) is an even number. However, when the number of slots N in the period (cycle) is small, for example when N≤16, the minimum distance between poor reception points in the complex plane can be guaranteed to be a certain length, since the number of poor reception points is small. Accordingly, when N≤16, even if N is an even number, cases do exist where data reception quality can be guaranteed.

Therefore, in the method for regularly hopping between precoding matrices based on Equation 232, when the number of slots N in the period (cycle) is set to an odd number, the probability of improving data reception quality is high. Precoding matrices F[0]-F[N−1] are generated based on Equation 232 (the precoding matrices F[0]-F[N−1] may be in any order for the N slots in the period (cycle)). Symbol number Ni may be precoded using F[0], symbol number Ni+1 may be precoded using F[1], . . . , and symbol number N×i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , N−2, N−1). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.) Furthermore, when the modulation method for both s1 and s2 is 16QAM, if a is set as follows,

Math 247

$\begin{matrix} {\alpha = \frac{\sqrt{2} + 4}{\sqrt{2} + 2}} & {{Equation}\mspace{14mu} 233} \end{matrix}$

the advantageous effect of increasing the minimum distance between 16×16=256 signal points in the IQ plane for a specific LOS environment may be achieved.

In the present embodiment, the method of structuring N different precoding matrices for a precoding hopping method with an N-slot time period (cycle) has been described. In this case, as the N different precoding matrices, F[0], F[1], F[2], . . . , F[N−2], F[N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[N−2], F[N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the N different precoding matrices F[0], F[1], F[2], . . . , F[N−2], F[N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with an N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using N different precoding matrices. In other words, the N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Furthermore, in the precoding matrix hopping method over an H-slot period (cycle) (H being a natural number larger than the number of slots N in the period (cycle) of the above method of regularly hopping between precoding matrices), when the N different precoding matrices of the present embodiment are included, the probability of excellent reception quality increases. In this case, Condition #17 and Condition #18 can be replaced by the following conditions. (The number of slots in the period (cycle) is considered to be N.)

Math 248

Condition #17′ e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∃x,∃y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 249

Condition #18′ e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∃x,∃y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Embodiment 10

The present embodiment describes a method for regularly hopping between precoding matrices using a unitary matrix that differs from the example in Embodiment 9.

In the method of regularly hopping between precoding matrices over a period (cycle) with 2N slots, the precoding matrices prepared for the 2N slots are represented as follows.

Math 250

$\begin{matrix} {{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{N - 1}:}} & {{Equation}\mspace{14mu} 234} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j(\;{{\theta_{21}{(i)}} + \lambda + \pi})} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0.

Math 251

$\begin{matrix} {{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{2N} - 1}:}} & {{Equation}\mspace{14mu} 235} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{\theta_{11}{(i)}}}} & e^{j\;{({{\theta_{11}{(i)}} + \lambda})}} \\ e^{j\;{\theta_{21}{(i)}}} & {\alpha \times e^{j(\;{{\theta_{21}{(i)}} + \lambda + \pi})}} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. (Let the α in Equation 234 and the α in Equation 235 be the same value.)

From Condition #5 (Math 106) and Condition #6 (Math 107) in Embodiment 3, the following conditions are important in Equation 234 for achieving excellent data reception quality.

Math 252

Condition #21 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 253

Condition #22 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Addition of the following condition is considered.

Math 254

Condition #23 θ₁₁(x)=θ₁₁(x+N) for ∀x(x=0,1,2, . . . ,N−2,N−1) and θ₂₁(y)=θ₂₁(y+N) for ∀y(y=0,1,2, . . . ,N−2,N−1)

Next, in order to distribute the poor reception points evenly with regards to phase in the complex plane, as described in Embodiment 6, Condition #24 and Condition #25 are provided.

Math 255

Condition #24

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{(\frac{2\pi}{N})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$ Math 256 Condition #25

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{({- \frac{2\pi}{N}})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$

In other words, Condition #24 means that the difference in phase is 2π/N radians. On the other hand, Condition #25 means that the difference in phase is −2π/N radians.

Letting θ₁₁(0)−θ₂₁(0)=0 radians, and letting α>1, the distribution of poor reception points for s1 and for s2 in the complex plane when N=4 is shown in FIGS. 45A and 45B. As is clear from FIGS. 45A and 45B, in the complex plane, the minimum distance between poor reception points for s1 is kept large, and similarly, the minimum distance between poor reception points for s2 is also kept large. Similar conditions are created when α<1. Furthermore, making the same considerations as in Embodiment 9, the probability of a greater distance between poor reception points in the complex plane increases when N is an odd number as compared to when N is an even number. However, when N is small, for example when N≤16, the minimum distance between poor reception points in the complex plane can be guaranteed to be a certain length, since the number of poor reception points is small. Accordingly, when N≤16, even if N is an even number, cases do exist where data reception quality can be guaranteed.

Therefore, in the method for regularly hopping between precoding matrices based on Equations 234 and 235, when N is set to an odd number, the probability of improving data reception quality is high. Precoding matrices F[0]-F[2N−1] are generated based on Equations 234 and 235 (the precoding matrices F[0]-F[2N−1] may be arranged in any order for the 2N slots in the period (cycle)). Symbol number 2Ni may be precoded using F[0], symbol number 2Ni+1 may be precoded using F[1], . . . , and symbol number 2N×i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , 2N−2, 2N−1). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.) Furthermore, when the modulation method for both s1 and s2 is 16QAM, if α is set as in Equation 233, the advantageous effect of increasing the minimum distance between 16×16=256 signal points in the IQ plane for a specific LOS environment may be achieved.

The following conditions are possible as conditions differing from Condition #23:

Math 257

Condition #26 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N−2, 2N−1; and x≠y.)

Math 258

Condition #27 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N−2, 2N−1; and x≠y.)

In this case, by satisfying Condition #21, Condition #22, Condition #26, and Condition #27, the distance in the complex plane between poor reception points for s1 is increased, as is the distance between poor reception points for s2, thereby achieving excellent data reception quality.

In the present embodiment, the method of structuring 2N different precoding matrices for a precoding hopping method with a 2N-slot time period (cycle) has been described. In this case, as the 2N different precoding matrices, F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the 2N different precoding matrices F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with a 2N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using 2N different precoding matrices. In other words, the 2N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Furthermore, in the precoding matrix hopping method over an H-slot period (cycle) (H being a natural number larger than the number of slots 2N in the period (cycle) of the above method of regularly hopping between precoding matrices), when the 2N different precoding matrices of the present embodiment are included, the probability of excellent reception quality increases.

Embodiment 11

The present embodiment describes a method for regularly hopping between precoding matrices using a non-unitary matrix.

In the method of regularly hopping between precoding matrices over a period (cycle) with 2N slots, the precoding matrices prepared for the 2N slots are represented as follows.

Math 259

$\begin{matrix} {{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{N - 1}:}} & {{Equation}\mspace{14mu} 236} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j(\;{{\theta_{21}{(i)}} + \lambda + \delta})} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. Furthermore, let δ≠π radians.

Math 260

$\begin{matrix} {{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{2N} - 1}:}} & {{Equation}\mspace{14mu} 237} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} & e^{j\;{\theta_{11}{(i)}}} \\ e^{j(\;{{\theta_{21}{(i)}} + \lambda + \delta})} & {\alpha \times e^{j\;{\theta_{21}{(i)}}}} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. (Let the α in Equation 236 and the α in Equation 237 be the same value.)

From Condition #5 (Math 106) and Condition #6 (Math 107) in Embodiment 3, the following conditions are important in Equation 236 for achieving excellent data reception quality.

Math 261

Condition #28 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 262

Condition #29 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−δ)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Addition of the following condition is considered.

Math 263

Condition #30 θ₁₁(x)=θ₁₁(x+N) for ∀x(x=0,1,2, . . . ,N−2,N−1) and θ₂₁(y)=θ₂₁(y+N) for ∀y(y=0,1,2, . . . ,N−2,N−1)

Note that instead of Equation 237, the precoding matrices in the following Equation may be provided.

Math 264

$\begin{matrix} {{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{2N} - 1}:}} & {{Equation}\mspace{14mu} 238} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{\theta_{11}{(i)}}}} & e^{j\;{({{\theta_{11}{(i)}} + \lambda})}} \\ e^{j\;{\theta_{21}{(i)}}} & {\alpha \times e^{j(\;{{\theta_{21}{(i)}} + \lambda - \delta})}} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. (Let the α in Equation 236 and the α in Equation 238 be the same value.)

As an example, in order to distribute the poor reception points evenly with regards to phase in the complex plane, as described in Embodiment 6, Condition #31 and Condition #32 are provided.

Math 265

Condition #31

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{(\frac{2\pi}{N})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$ Math 266 Condition #32

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{({- \frac{2\pi}{N}})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$

In other words, Condition #31 means that the difference in phase is 2π/N radians. On the other hand, Condition #32 means that the difference in phase is −2π/N radians.

Letting θ₁₁(0)−θ₂₁(0)=0 radians, letting α>1, and letting δ=(3π)/4 radians, the distribution of poor reception points for s1 and for s2 in the complex plane when N=4 is shown in FIGS. 46A and 46B. With these settings, the period (cycle) for hopping between precoding matrices is increased, and the minimum distance between poor reception points for s1, as well as the minimum distance between poor reception points for s2, in the complex plane is kept large, thereby achieving excellent reception quality. An example in which α>1, δ=(3π)/4 radians, and N=4 has been described, but the present invention is not limited in this way. Similar advantageous effects may be obtained for π/2 radians ≤|δ|<π radians, α>0, and α≠1.

The following conditions are possible as conditions differing from Condition #30:

Math 267

Condition #33 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N−2, 2N−1; and x≠y.)

Math 268

Condition #34 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N−2, 2N−1; and x≠y.)

In this case, by satisfying Condition #28, Condition #29, Condition #33, and Condition #34, the distance in the complex plane between poor reception points for s1 is increased, as is the distance between poor reception points for s2, thereby achieving excellent data reception quality.

In the present embodiment, the method of structuring 2N different precoding matrices for a precoding hopping method with a 2N-slot time period (cycle) has been described. In this case, as the 2N different precoding matrices, F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the 2N different precoding matrices F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with a 2N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using 2N different precoding matrices. In other words, the 2N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Furthermore, in the precoding matrix hopping method over an H-slot period (cycle) (H being a natural number larger than the number of slots 2N in the period (cycle) of the above method of regularly hopping between precoding matrices), when the 2N different precoding matrices of the present embodiment are included, the probability of excellent reception quality increases.

Embodiment 12

The present embodiment describes a method for regularly hopping between precoding matrices using a non-unitary matrix.

In the method of regularly hopping between precoding matrices over a period (cycle) with N slots, the precoding matrices prepared for the N slots are represented as follows.

Math 269

$\begin{matrix} {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j(\;{{\theta_{21}{(i)}} + \lambda + \delta})} \end{pmatrix}}} & {{Equation}\mspace{14mu} 239} \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. Furthermore, let δ≠π radians (a fixed value not depending on i), and i=0, 1, 2, . . . , N−2, N−1.

From Condition #5 (Math 106) and Condition #6 (Math 107) in Embodiment 3, the following conditions are important in Equation 239 for achieving excellent data reception quality.

Math 270

Condition #35 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 271

Condition #36 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−δ)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

As an example, in order to distribute the poor reception points evenly with regards to phase in the complex plane, as described in Embodiment 6, Condition #37 and Condition #38 are provided.

Math 272

Condition #37

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{(\frac{2\pi}{N})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$ Math 273 Condition #38

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{({- \frac{2\pi}{N}})}}\mspace{11mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$

In other words, Condition #37 means that the difference in phase is 2π/N radians. On the other hand, Condition #38 means that the difference in phase is −2π/N radians.

In this case, if π/2 radians ≤|δ|<π radians, α>0, and α≠1, the distance in the complex plane between poor reception points for s1 is increased, as is the distance between poor reception points for s2, thereby achieving excellent data reception quality. Note that Condition #37 and Condition #38 are not always necessary.

In the present embodiment, the method of structuring N different precoding matrices for a precoding hopping method with an N-slot time period (cycle) has been described. In this case, as the N different precoding matrices, F[0], F[1], F[2], . . . , F[N−2], F[N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[N−2], F[N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the N different precoding matrices F[0], F[1], F[2], . . . , F[N−2], F[N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with an N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using N different precoding matrices. In other words, the N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Furthermore, in the precoding matrix hopping method over an H-slot period (cycle) (H being a natural number larger than the number of slots N in the period (cycle) of the above method of regularly hopping between precoding matrices), when the N different precoding matrices of the present embodiment are included, the probability of excellent reception quality increases. In this case, Condition #35 and Condition #36 can be replaced by the following conditions. (The number of slots in the period (cycle) is considered to be N.)

Math 274

Condition #35′ e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∃x,∃y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 275

Condition #36′ e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−δ)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−δ)) for ∃x,∃y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Embodiment 13

The present embodiment describes a different example than Embodiment 8.

In the method of regularly hopping between precoding matrices over a period (cycle) with 2N slots, the precoding matrices prepared for the 2N slots are represented as follows.

Math 276

$\begin{matrix} {{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{N - 1}:}} & {{Equation}\mspace{14mu} 240} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j(\;{{\theta_{21}{(i)}} + \lambda + \delta})} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. Furthermore, let δ≠π radians.

Math 277

$\begin{matrix} {{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{2N} - 1}:}} & {{Equation}\mspace{14mu} 241} \\ {{F\lbrack i\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} & e^{j\;{\theta_{11}{(i)}}} \\ e^{j(\;{{\theta_{21}{(i)}} + \lambda + \delta})} & {\alpha \times e^{j\;{\theta_{21}{(i)}}}} \end{pmatrix}}} & \; \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. (Let the α in Equation 240 and the α in Equation 241 be the same value.)

Furthermore, the 2×N×M period (cycle) precoding matrices based on Equations 240 and 241 are represented by the following equations.

Math 278

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{N - 1}:}}} & {{Equation}\mspace{14mu} 242} \\ {{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{({{\theta_{21}{(i)}} + X_{k}})}}} & e^{j(\;{{\theta_{21}{(i)}} + X_{k} + \lambda + \delta})} \end{pmatrix}}} & \; \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1.

Math 279

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = N},{N + 1},\;{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{{2N} - 1}:{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j{({{\theta_{11}{(i)}} + \lambda})}}} & e^{j\;{\theta_{11}{(i)}}} \\ e^{j{({{\theta_{21}{(i)}} + \lambda + \delta + Y_{k}})}} & {\alpha \times e^{j\;{\theta_{21}{({i + Y_{k}})}}}} \end{pmatrix}}}}} & {{Equation}\mspace{14mu} 243} \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1. Furthermore, Xk=Yk may be true, or Xk≠Yk may be true.

Precoding matrices F[0]-F[2×N×M−1] are thus generated (the precoding matrices F[0]-F[2×N×M−1] may be in any order for the 2×N×M slots in the period (cycle)). Symbol number 2×N×M×i may be precoded using F[0], symbol number 2×N×M×i+1 may be precoded using F[1], . . . , and symbol number 2×N×M×i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , 2×N×M−2, 2×N×M−1). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.)

Generating the precoding matrices in this way achieves a precoding matrix hopping method with a large period (cycle), allowing for the position of poor reception points to be easily changed, which may lead to improved data reception quality.

The 2×N×M period (cycle) precoding matrices in Equation 242 may be changed to the following equation.

Math 280

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{{N - 1}:{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{({{\theta_{11}{(i)}} + X_{k}})}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + X_{k} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j{({{\theta_{21}{(i)}} + \lambda + \delta})}} \end{pmatrix}}}}} & {{Equation}\mspace{14mu} 244} \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1.

The 2×N×M period (cycle) precoding matrices in Equation 243 may also be changed to any of Equations 245-247.

Math 281

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = N},{N + 1},\;{N + 2},\;\ldots\mspace{14mu},{{2N} - 2},\;{{{{2N} - 1}:{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda + Y_{k}})}}} & e^{j\;{\theta_{11}{({i + Y_{k}})}}} \\ e^{j{({{\theta_{21}{(i)}} + \lambda + \delta})}} & {\alpha \times e^{j\;{\theta_{21}{(i)}}}} \end{pmatrix}}}}} & {{Equation}\mspace{14mu} 245} \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1.

Math 282

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{{2N} - 1}:{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{\theta_{11}{(i)}}}} & e^{j{({{\theta_{11}{(i)}} + \lambda})}} \\ e^{j\;{\theta_{21}{({i + Y_{k}})}}} & {\alpha \times e^{j\;{({{\theta_{21}{(i)}} + \lambda - \delta + Y_{k}})}}} \end{pmatrix}}}}} & {{Equation}\mspace{14mu} 246} \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1.

Math 283

$\begin{matrix} {\mspace{79mu}{{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{{2N} - 1}:{F\left\lbrack {{2 \times N \times k} + i} \right\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{\theta_{11}{({i + Y_{k}})}}}} & e^{j\;{({{\theta_{11}{(i)}} + \lambda + Y_{k}})}} \\ e^{j\;{\theta_{21}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{21}{(i)}} + \lambda - \delta})}}} \end{pmatrix}}}}} & {{Equation}\mspace{14mu} 247} \end{matrix}$

In this case, k=0, 1, . . . , M−2, M−1.

Focusing on poor reception points, if Equations 242 through 247 satisfy the following conditions,

Math 284

Condition #39 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 285

Condition #40 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−δ)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−δ)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 286

Condition #41 θ₁₁(x)=θ₁₁(x+N) for ∀x(x=0,1,2, . . . ,N−2,N−1) and θ₂₁(y)=θ₂₁(y+N) for ∀y(y=0,1,2, . . . ,N−2,N−1)

then excellent data reception quality is achieved. Note that in Embodiment 8, Condition #39 and Condition #40 should be satisfied.

Focusing on Xk and Yk, if Equations 242 through 247 satisfy the following conditions,

Math 287

Condition #42 X _(a) ≠X _(b)+2×s×π for ∀a,∀b(a≠b;a,b=0,1,2, . . . ,M−2,M−1)

(a is 0, 1, 2, . . . , M−2, M−1; b is 0, 1, 2, . . . , M−2, M−1; and a≠b.)

(Here, s is an integer.)

Math 288

Condition #43 Y _(a) ≠Y _(b)+2×u×π for ∀a,∀b(a≠b;a,b=0,1,2, . . . ,M−2,M−1)

(a is 0, 1, 2, . . . , M−2, M−1; b is 0, 1, 2, . . . , M−2, M−1; and a≠b.)

(Here, u is an integer.)

then excellent data reception quality is achieved. Note that in Embodiment 8, Condition #42 should be satisfied.

In Equations 242 and 247, when 0 radians ≤δ<2π radians, the matrices are a unitary matrix when δ=π radians and are a non-unitary matrix when δ≠π radians. In the present method, use of a non-unitary matrix for π/2 radians ≤|δ|<π radians is one characteristic structure, and excellent data reception quality is obtained. Use of a unitary matrix is another structure, and as described in detail in Embodiment 10 and Embodiment 16, if N is an odd number in Equations 242 through 247, the probability of obtaining excellent data reception quality increases.

Embodiment 14

The present embodiment describes an example of differentiating between usage of a unitary matrix and a non-unitary matrix as the precoding matrix in the method for regularly hopping between precoding matrices.

The following describes an example that uses a two-by-two precoding matrix (letting each element be a complex number), i.e. the case when two modulated signals (s1(t) and s2(t)) that are based on a modulation method are precoded, and the two precoded signals are transmitted by two antennas.

When transmitting data using a method of regularly hopping between precoding matrices, the mappers 306A and 306B in the transmission device in FIG. 3 and FIG. 13 switch the modulation method in accordance with the frame structure signal 313. The relationship between the modulation level (the number of signal points for the modulation method in the IQ plane) of the modulation method and the precoding matrices is described.

The advantage of the method of regularly hopping between precoding matrices is that, as described in Embodiment 6, excellent data reception quality is achieved in an LOS environment. In particular, when the reception device performs ML calculation or applies APP (or Max-log APP) based on ML calculation, the advantageous effect is considerable. Incidentally, ML calculation greatly impacts circuit scale (calculation scale) in accordance with the modulation level of the modulation method. For example, when two precoded signals are transmitted from two antennas, and the same modulation method is used for two modulated signals (signals based on the modulation method before precoding), the number of candidate signal points in the IQ plane (received signal points 1101 in FIG. 11) is 4×4=16 when the modulation method is QPSK, 16×16=256 when the modulation method is 16QAM, 64×64=4096 when the modulation method is 64QAM, 256×256=65,536 when the modulation method is 256QAM, and 1024×1024=1,048,576 when the modulation method is 256QAM. In order to keep the calculation scale of the reception device down to a certain circuit size, when the modulation method is QPSK, 16QAM, or 64QAM, ML calculation ((Max-log) APP based on ML calculation) is used, and when the modulation method is 256QAM or 1024QAM, linear operation such as MMSE or ZF is used in the reception device. (In some cases, ML calculation may be used for 256QAM.)

When such a reception device is assumed, consideration of the Signal-to-Noise power Ratio (SNR) after separation of multiple signals indicates that a unitary matrix is appropriate as the precoding matrix when the reception device performs linear operation such as MMSE or ZF, whereas either a unitary matrix or a non-unitary matrix may be used when the reception device performs ML calculation. Taking any of the above embodiments into consideration, when two precoded signals are transmitted from two antennas, the same modulation method is used for two modulated signals (signals based on the modulation method before precoding), a non-unitary matrix is used as the precoding matrix in the method for regularly hopping between precoding matrices, the modulation level of the modulation method is equal to or less than 64 (or equal to or less than 256), and a unitary matrix is used when the modulation level is greater than 64 (or greater than 256), then for all of the modulation methods supported by the transmission system, there is an increased probability of achieving the advantageous effect whereby excellent data reception quality is achieved for any of the modulation methods while reducing the circuit scale of the reception device.

When the modulation level of the modulation method is equal to or less than 64 (or equal to or less than 256) as well, in some cases use of a unitary matrix may be preferable. Based on this consideration, when a plurality of modulation methods are supported in which the modulation level is equal to or less than 64 (or equal to or less than 256), it is important that in some cases, in some of the plurality of supported modulation methods where the modulation level is equal to or less than 64, a non-unitary matrix is used as the precoding matrix in the method for regularly hopping between precoding matrices.

The case of transmitting two precoded signals from two antennas has been described above as an example, but the present invention is not limited in this way. In the case when N precoded signals are transmitted from N antennas, and the same modulation method is used for N modulated signals (signals based on the modulation method before precoding), a threshold β_(N) may be established for the modulation level of the modulation method. When a plurality of modulation methods for which the modulation level is equal to or less than β_(N) are supported, in some of the plurality of supported modulation methods where the modulation level is equal to or less than β_(N), a non-unitary matrix is used as the precoding matrices in the method for regularly hopping between precoding matrices, whereas for modulation methods for which the modulation level is greater than β_(N), a unitary matrix is used. In this way, for all of the modulation methods supported by the transmission system, there is an increased probability of achieving the advantageous effect whereby excellent data reception quality is achieved for any of the modulation methods while reducing the circuit scale of the reception device. (When the modulation level of the modulation method is equal to or less than β_(N), a non-unitary matrix may always be used as the precoding matrix in the method for regularly hopping between precoding matrices.)

In the above description, the same modulation method has been described as being used in the modulation method for simultaneously transmitting N modulated signals. The following, however, describes the case in which two or more modulation methods are used for simultaneously transmitting N modulated signals.

As an example, the case in which two precoded signals are transmitted by two antennas is described. The two modulated signals (signals based on the modulation method before precoding) are either modulated with the same modulation method, or when modulated with different modulation methods, are modulated with a modulation method having a modulation level of 2^(a1) or a modulation level of 2^(a2). In this case, when the reception device uses ML calculation ((Max-log) APP based on ML calculation), the number of candidate signal points in the IQ plane (received signal points 1101 in FIG. 11) is 2^(a1)×2^(a2)=2^(a1+a2). As described above, in order to achieve excellent data reception quality while reducing the circuit scale of the reception device, a threshold 2^(β) may be provided for 2^(a1+a2), and when 2^(a1+a2)≤2^(β), a non-unitary matrix may be used as the precoding matrix in the method for regularly hopping between precoding matrices, whereas a unitary matrix may be used when 2^(a1+a2)>2^(β).

Furthermore, when 2^(a1+a2)≤2^(β), in some cases use of a unitary matrix may be preferable. Based on this consideration, when a plurality of combinations of modulation methods are supported for which 2^(a1+a2)≤2^(β), it is important that in some of the supported combinations of modulation methods for which 2^(a1+a2)≤2^(β), a non-unitary matrix is used as the precoding matrix in the method for regularly hopping between precoding matrices.

As an example, the case in which two precoded signals are transmitted by two antennas has been described, but the present invention is not limited in this way. For example, N modulated signals (signals based on the modulation method before precoding) may be either modulated with the same modulation method or, when modulated with different modulation methods, the modulation level of the modulation method for the i^(th) modulated signal may be 2^(ai) (where i=1, 2, . . . , N−1, N).

In this case, when the reception device uses ML calculation ((Max-log) APP based on ML calculation), the number of candidate signal points in the IQ plane (received signal points 1101 in FIG. 11) is 2^(a1)×2^(a2)× . . . ×2^(ai)× . . . ×2^(aN)=2^(a1+a2+ . . . +ai+ . . . +aN). As described above, in order to achieve excellent data reception quality while reducing the circuit scale of the reception device, a threshold 2^(β) may be provided for 2^(a1+a2+ . . . +ai+ . . . +aN).

Math 289

Condition #44 2^(a1+a2+ . . . +ai+ . . . +aN)=2^(Y)≤2^(β) where

$Y = {\sum\limits_{i = 1}^{N}a_{i}}$

When a plurality of combinations of a modulation methods satisfying Condition #44 are supported, in some of the supported combinations of modulation methods satisfying Condition #44, a non-unitary matrix are used as the precoding matrix in the method for regularly hopping between precoding matrices.

Math 290

Condition #45 2^(a1+a2+ . . . +ai+ . . . +aN)=2^(Y)>2^(β) where

$Y = {\sum\limits_{i = 1}^{N}a_{i}}$

By using a unitary matrix in all of the combinations of modulation methods satisfying Condition #45, then for all of the modulation methods supported by the transmission system, there is an increased probability of achieving the advantageous effect whereby excellent data reception quality is achieved while reducing the circuit scale of the reception device for any of the combinations of modulation methods. (A non-unitary matrix may be used as the precoding matrix in the method for regularly hopping between precoding matrices in all of the supported combinations of modulation methods satisfying Condition #44.)

Embodiment 15

The present embodiment describes an example of a system that adopts a method for regularly hopping between precoding matrices using a multi-carrier transmission method such as OFDM.

FIGS. 47A and 47B show an example according to the present embodiment of frame structure in the time and frequency domains for a signal transmitted by a broadcast station (base station) in a system that adopts a method for regularly hopping between precoding matrices using a multi-carrier transmission method such as OFDM. (The frame structure is set to extend from time $1 to time $T.) FIG. 47A shows the frame structure in the time and frequency domains for the stream s1 described in Embodiment 1, and FIG. 47B shows the frame structure in the time and frequency domains for the stream s2 described in Embodiment 1. Symbols at the same time and the same (sub)carrier in stream s1 and stream s2 are transmitted by a plurality of antennas at the same time and the same frequency.

In FIGS. 47A and 47B, the (sub)carriers used when using OFDM are divided as follows: a carrier group #A composed of (sub)carrier a−(sub)carrier a+Na, a carrier group #B composed of (sub)carrier b−(sub)carrier b+Nb, a carrier group #C composed of (sub)carrier c−(sub)carrier c+Nc, a carrier group #D composed of (sub)carrier d−(sub)carrier d+Nd, . . . . In each subcarrier group, a plurality of transmission methods are assumed to be supported. By supporting a plurality of transmission methods, it is possible to effectively capitalize on the advantages of the transmission methods. For example, in FIGS. 47A and 47B, a spatial multiplexing MIMO system, or a MIMO system with a fixed precoding matrix is used for carrier group #A, a MIMO system that regularly hops between precoding matrices is used for carrier group #B, only stream s1 is transmitted in carrier group #C, and space-time block coding is used to transmit carrier group #D.

FIGS. 48A and 48B show an example according to the present embodiment of frame structure in the time and frequency domains for a signal transmitted by a broadcast station (base station) in a system that adopts a method for regularly hopping between precoding matrices using a multi-carrier transmission method such as OFDM. FIGS. 48A and 48B show a frame structure at a different time than FIGS. 47A and 47B, from time $X to time $X+T′. In FIGS. 48A and 48B, as in FIGS. 47A and 47B, the (sub)carriers used when using OFDM are divided as follows: a carrier group #A composed of (sub)carrier a−(sub)carrier a+Na, a carrier group #B composed of (sub)carrier b−(sub)carrier b+Nb, a carrier group #C composed of (sub)carrier c−(sub)carrier c+Nc, a carrier group #D composed of (sub)carrier d−(sub)carrier d+Nd, . . . . The difference between FIGS. 47A and 47B and FIGS. 48A and 48B is that in some carrier groups, the transmission method used in FIGS. 47A and 47B differs from the transmission method used in FIGS. 48A and 48B. In FIGS. 48A and 48B, space-time block coding is used to transmit carrier group #A, a MIMO system that regularly hops between precoding matrices is used for carrier group #B, a MIMO system that regularly hops between precoding matrices is used for carrier group #C, and only stream s1 is transmitted in carrier group #D.

Next, the supported transmission methods are described.

FIG. 49 shows a signal processing method when using a spatial multiplexing MIMO system or a MIMO system with a fixed precoding matrix. FIG. 49 bears the same numbers as in FIG. 6.

A weighting unit 600, which is a baseband signal in accordance with a certain modulation method, receives as inputs a stream s1(t) (307A), a stream s2(t) (307B), and information 315 regarding the weighting method, and outputs a modulated signal z1(t) (309A) after weighting and a modulated signal z2(t) (309B) after weighting. Here, when the information 315 regarding the weighting method indicates a spatial multiplexing MIMO system, the signal processing in method #1 of FIG. 49 is performed. Specifically, the following processing is performed.

Math 291

$\begin{matrix} \begin{matrix} {\begin{pmatrix} {z\; 1(t)} \\ {z\; 2(t)} \end{pmatrix} = {\begin{pmatrix} e^{j\; 0} & 0 \\ 0 & e^{j\; 0} \end{pmatrix}\begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}}} \\ {= {{\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}\begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}} = \begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}}} \end{matrix} & {{Equation}\mspace{14mu} 250} \end{matrix}$

When a method for transmitting one modulated signal is supported, from the standpoint of transmission power, Equation 250 may be represented as Equation 251.

Math 292

$\begin{matrix} \begin{matrix} {\begin{pmatrix} {z\; 1(t)} \\ {z\; 2(t)} \end{pmatrix} = {\frac{1}{\sqrt{2}}\begin{pmatrix} e^{j\; 0} & 0 \\ 0 & e^{j\; 0} \end{pmatrix}\begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}}} \\ {= {{\frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}\begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}} = \begin{pmatrix} {\frac{1}{\sqrt{2}}s\; 1(t)} \\ {\frac{1}{\sqrt{2}}s\; 2(t)} \end{pmatrix}}} \end{matrix} & {{Equation}\mspace{14mu} 251} \end{matrix}$

When the information 315 regarding the weighting method indicates a MIMO system in which precoding matrices are regularly hopped between, signal processing in method #2, for example, of FIG. 49 is performed. Specifically, the following processing is performed.

Math 293

$\begin{matrix} {\begin{pmatrix} {z\; 1(t)} \\ {z\; 2(t)} \end{pmatrix} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;\theta_{11}} & {\alpha \times e^{j(\;{\theta_{11} + \lambda})}} \\ {\alpha \times e^{j\;\theta_{21}}} & e^{j(\;{\theta_{21} + \lambda + \delta})} \end{pmatrix}\begin{pmatrix} {s\; 1(t)} \\ {s\; 2(t)} \end{pmatrix}}} & {{Equation}\mspace{14mu} 252} \end{matrix}$

Here, θ₁₁, θ₁₂, λ, and δ are fixed values.

FIG. 50 shows the structure of modulated signals when using space-time block coding. A space-time block coding unit (5002) in FIG. 50 receives, as input, a baseband signal based on a certain modulation signal. For example, the space-time block coding unit (5002) receives symbol s1, symbol s2, . . . as inputs. As shown in FIG. 50, space-time block coding is performed, z1(5003A) becomes “s1 as symbol #0”, “−s2* as symbol #0”, “s3 as symbol #2”, “−s4* as symbol #3” . . . , and z2(5003B) becomes “s2 as symbol #0”, “s1* as symbol #1”, “s4 as symbol #2”, “s3* as symbol #3” . . . . In this case, symbol #X in z1 and symbol #X in z2 are transmitted from the antennas at the same time, over the same frequency.

In FIGS. 47A, 47B, 48A, and 48B, only symbols transmitting data are shown. In practice, however, it is necessary to transmit information such as the transmission method, modulation method, error correction method, and the like. For example, as in FIG. 51, these pieces of information can be transmitted to a communication partner by regular transmission with only one modulated signal z1. It is also necessary to transmit symbols for estimation of channel fluctuation, i.e. for the reception device to estimate channel fluctuation (for example, a pilot symbol, reference symbol, preamble, a Phase Shift Keying (PSK) symbol known at the transmission and reception sides, and the like). In FIGS. 47A, 47B, 48A, and 48B, these symbols are omitted. In practice, however, symbols for estimating channel fluctuation are included in the frame structure in the time and frequency domains. Accordingly, each carrier group is not composed only of symbols for transmitting data. (The same is true for Embodiment 1 as well.)

FIG. 52 is an example of the structure of a transmission device in a broadcast station (base station) according to the present embodiment. A transmission method determining unit (5205) determines the number of carriers, modulation method, error correction method, coding rate for error correction coding, transmission method, and the like for each carrier group and outputs a control signal (5206).

A modulated signal generating unit #1 (5201_1) receives, as input, information (5200_1) and the control signal (5206) and, based on the information on the transmission method in the control signal (5206), outputs a modulated signal z1 (5202_1) and a modulated signal z2 (5203_1) in the carrier group #A of FIGS. 47A, 47B, 48A, and 48B.

Similarly, a modulated signal generating unit #2 (5201_2) receives, as input, information (5200_2) and the control signal (5206) and, based on the information on the transmission method in the control signal (5206), outputs a modulated signal z1 (5202_2) and a modulated signal z2 (5203_2) in the carrier group #B of FIGS. 47A, 47B, 48A, and 48B.

Similarly, a modulated signal generating unit #3 (5201_3) receives, as input, information (5200_3) and the control signal (5206) and, based on the information on the transmission method in the control signal (5206), outputs a modulated signal z1 (5202_3) and a modulated signal z2 (5203_3) in the carrier group #C of FIGS. 47A, 47B, 48A, and 48B.

Similarly, a modulated signal generating unit #4 (5201_4) receives, as input, information (5200_4) and the control signal (5206) and, based on the information on the transmission method in the control signal (5206), outputs a modulated signal z1 (5202_4) and a modulated signal z2 (5203_4) in the carrier group #D of FIGS. 47A, 47B, 48A, and 48B.

While not shown in the figures, the same is true for modulated signal generating unit #5 through modulated signal generating unit #M−1.

Similarly, a modulated signal generating unit #M (5201_M) receives, as input, information (5200_M) and the control signal (5206) and, based on the information on the transmission method in the control signal (5206), outputs a modulated signal z1 (5202_M) and a modulated signal z2 (5203_M) in a certain carrier group.

An OFDM related processor (5207_1) receives, as inputs, the modulated signal z1 (5202_1) in carrier group #A, the modulated signal z1 (5202_2) in carrier group #B, the modulated signal z1 (5202_3) in carrier group #C, the modulated signal z1 (5202_4) in carrier group #D, . . . , the modulated signal z1 (5202_M) in a certain carrier group #M, and the control signal (5206), performs processing such as reordering, inverse Fourier transform, frequency conversion, amplification, and the like, and outputs a transmission signal (5208_1). The transmission signal (5208_1) is output as a radio wave from an antenna (5209_1).

Similarly, an OFDM related processor (5207_2) receives, as inputs, the modulated signal z2 (5203_1) in carrier group #A, the modulated signal z2 (5203_2) in carrier group #B, the modulated signal z2 (5203_3) in carrier group #C, the modulated signal z2 (5203_4) in carrier group #D, . . . , the modulated signal z2 (5203_M) in a certain carrier group #M, and the control signal (5206), performs processing such as reordering, inverse Fourier transform, frequency conversion, amplification, and the like, and outputs a transmission signal (5208_2). The transmission signal (5208_2) is output as a radio wave from an antenna (5209_2).

FIG. 53 shows an example of a structure of the modulated signal generating units #1-#M in FIG. 52. An error correction encoder (5302) receives, as inputs, information (5300) and a control signal (5301) and, in accordance with the control signal (5301), sets the error correction coding method and the coding rate for error correction coding, performs error correction coding, and outputs data (5303) after error correction coding. (In accordance with the setting of the error correction coding method and the coding rate for error correction coding, when using LDPC coding, turbo coding, or convolutional coding, for example, depending on the coding rate, puncturing may be performed to achieve the coding rate.)

An interleaver (5304) receives, as input, error correction coded data (5303) and the control signal (5301) and, in accordance with information on the interleaving method included in the control signal (5301), reorders the error correction coded data (5303) and outputs interleaved data (5305).

A mapper (5306_1) receives, as input, the interleaved data (5305) and the control signal (5301) and, in accordance with the information on the modulation method included in the control signal (5301), performs mapping and outputs a baseband signal (5307_1).

Similarly, a mapper (5306_2) receives, as input, the interleaved data (5305) and the control signal (5301) and, in accordance with the information on the modulation method included in the control signal (5301), performs mapping and outputs a baseband signal (5307_2).

A signal processing unit (5308) receives, as input, the baseband signal (5307_1), the baseband signal (5307_2), and the control signal (5301) and, based on information on the transmission method (for example, in this embodiment, a spatial multiplexing MIMO system, a MIMO system using a fixed precoding matrix, a MIMO system for regularly hopping between precoding matrices, space-time block coding, or a transmission method for transmitting only stream s1) included in the control signal (5301), performs signal processing. The signal processing unit (5308) outputs a processed signal z1 (5309_1) and a processed signal z2 (5309_2). Note that when the transmission method for transmitting only stream s1 is selected, the signal processing unit (5308) does not output the processed signal z2 (5309_2). Furthermore, in FIG. 53, one error correction encoder is shown, but the present invention is not limited in this way. For example, as shown in FIG. 3, a plurality of encoders may be provided.

FIG. 54 shows an example of the structure of the OFDM related processors (5207_1 and 5207_2) in FIG. 52. Elements that operate in a similar way to FIG. 14 bear the same reference signs. A reordering unit (5402A) receives, as input, the modulated signal z1 (5400_1) in carrier group #A, the modulated signal z1 (5400_2) in carrier group #B, the modulated signal z1 (5400_3) in carrier group #C, the modulated signal z1 (5400_4) in carrier group #D, . . . , the modulated signal z1 (5400_M) in a certain carrier group, and a control signal (5403), performs reordering, and output reordered signals 1405A and 1405B. Note that in FIGS. 47A, 47B, 48A, 48B, and 51, an example of allocation of the carrier groups is described as being formed by groups of subcarriers, but the present invention is not limited in this way. Carrier groups may be formed by discrete subcarriers at each time interval. Furthermore, in FIGS. 47A, 47B, 48A, 48B, and 51, an example has been described in which the number of carriers in each carrier group does not change over time, but the present invention is not limited in this way. This point will be described separately below.

FIGS. 55A and 55B show an example of frame structure in the time and frequency domains for a method of setting the transmission method for each carrier group, as in FIGS. 47A, 47B, 48A, 48B, and 51. In FIGS. 55A and 55B, control information symbols are labeled 5500, individual control information symbols are labeled 5501, data symbols are labeled 5502, and pilot symbols are labeled 5503. Furthermore, FIG. 55A shows the frame structure in the time and frequency domains for stream s1, and FIG. 55B shows the frame structure in the time and frequency domains for stream s2.

The control information symbols are for transmitting control information shared by the carrier group and are composed of symbols for the transmission and reception devices to perform frequency and synchronization of time, information regarding the allocation of (sub)carriers, and the like. The control information symbols are set to be transmitted from only stream s1 at time $1.

The individual control information symbols are for transmitting control information on individual subcarrier groups and are composed of information on the transmission method, modulation method, error correction coding method, coding rate for error correction coding, block size of error correction codes, and the like for the data symbols, information on the insertion method of pilot symbols, information on the transmission power of pilot symbols, and the like. The individual control information symbols are set to be transmitted from only stream s1 at time $1.

The data symbols are for transmitting data (information), and as described with reference to FIGS. 47A through 50, are symbols of one of the following transmission methods, for example: a spatial multiplexing MIMO system, a MIMO system using a fixed precoding matrix, a MIMO system for regularly hopping between precoding matrices, space-time block coding, or a transmission method for transmitting only stream s1. Note that in carrier group #A, carrier group #B, carrier group #C, and carrier group #D, data symbols are shown in stream s2, but when the transmission method for transmitting only stream s1 is used, in some cases there are no data symbols in stream s2.

The pilot symbols are for the reception device to perform channel estimation, i.e. to estimate fluctuation corresponding to h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t) in Equation 36. (In this embodiment, since a multi-carrier transmission method such as an OFDM method is used, the pilot symbols are for estimating fluctuation corresponding to h₁₁(t), h₁₂(t), h₂₁(t), and h₂₂(t) in each subcarrier.) Accordingly, the PSK transmission method, for example, is used for the pilot symbols, which are structured to form a pattern known by the transmission and reception devices. Furthermore, the reception device may use the pilot symbols for estimation of frequency offset, estimation of phase distortion, and synchronization of time.

FIG. 56 shows an example of the structure of a reception device for receiving modulated signals transmitted by the transmission device in FIG. 52. Elements that operate in a similar way to FIG. 7 bear the same reference signs.

In FIG. 56, an OFDM related processor (5600_X) receives, as input, a received signal 702_X, performs predetermined processing, and outputs a processed signal 704_X. Similarly, an OFDM related processor (5600_Y) receives, as input, a received signal 702_Y, performs predetermined processing, and outputs a processed signal 704_Y.

The control information decoding unit 709 in FIG. 56 receives, as input, the processed signals 704_X and 704_Y, extracts the control information symbols and individual control information symbols in FIGS. 55A and 55B to obtain the control information transmitted by these symbols, and outputs a control signal 710 that includes the obtained information.

The channel fluctuation estimating unit 705_1 for the modulated signal z1 receives, as inputs, the processed signal 704_X and the control signal 710, performs channel estimation in the carrier group required by the reception device (the desired carrier group), and outputs a channel estimation signal 706_1.

Similarly, the channel fluctuation estimating unit 705_2 for the modulated signal z2 receives, as inputs, the processed signal 704_X and the control signal 710, performs channel estimation in the carrier group required by the reception device (the desired carrier group), and outputs a channel estimation signal 706_2.

Similarly, the channel fluctuation estimating unit 705_1 for the modulated signal z1 receives, as inputs, the processed signal 704_Y and the control signal 710, performs channel estimation in the carrier group required by the reception device (the desired carrier group), and outputs a channel estimation signal 708_1.

Similarly, the channel fluctuation estimating unit 705_2 for the modulated signal z2 receives, as inputs, the processed signal 704_Y and the control signal 710, performs channel estimation in the carrier group required by the reception device (the desired carrier group), and outputs a channel estimation signal 708_2.

The signal processing unit 711 receives, as inputs, the signals 706_1, 706_2, 708_1, 708_2, 704_X, 704_Y, and the control signal 710. Based on the information included in the control signal 710 on the transmission method, modulation method, error correction coding method, coding rate for error correction coding, block size of error correction codes, and the like for the data symbols transmitted in the desired carrier group, the signal processing unit 711 demodulates and decodes the data symbols and outputs received data 712.

FIG. 57 shows the structure of the OFDM related processors (5600_X, 5600_Y) in FIG. 56. A frequency converter (5701) receives, as input, a received signal (5700), performs frequency conversion, and outputs a frequency converted signal (5702).

A Fourier transformer (5703) receives, as input, the frequency converted signal (5702), performs a Fourier transform, and outputs a Fourier transformed signal (5704).

As described above, when using a multi-carrier transmission method such as an OFDM method, carriers are divided into a plurality of carrier groups, and the transmission method is set for each carrier group, thereby allowing for the reception quality and transmission speed to be set for each carrier group, which yields the advantageous effect of construction of a flexible system. In this case, as described in other embodiments, allowing for choice of a method of regularly hopping between precoding matrices offers the advantages of obtaining high reception quality, as well as high transmission speed, in an LOS environment. While in the present embodiment, the transmission methods to which a carrier group can be set are “a spatial multiplexing MIMO system, a MIMO system using a fixed precoding matrix, a MIMO system for regularly hopping between precoding matrices, space-time block coding, or a transmission method for transmitting only stream s1”, but the transmission methods are not limited in this way. Furthermore, the space-time coding is not limited to the method described with reference to FIG. 50, nor is the MIMO system using a fixed precoding matrix limited to method #2 in FIG. 49, as any structure with a fixed precoding matrix is acceptable. In the present embodiment, the case of two antennas in the transmission device has been described, but when the number of antennas is larger than two as well, the same advantageous effects may be achieved by allowing for selection of a transmission method for each carrier group from among “a spatial multiplexing MIMO system, a MIMO system using a fixed precoding matrix, a MIMO system for regularly hopping between precoding matrices, space-time block coding, or a transmission method for transmitting only stream s1”.

FIGS. 58A and 58B show a method of allocation into carrier groups that differs from FIGS. 47A, 47B, 48A, 48B, and 51. In FIGS. 47A, 47B, 48A, 48B, 51, 55A, and 55B, carrier groups have described as being formed by groups of subcarriers. In FIGS. 58A and 58B, on the other hand, the carriers in a carrier group are arranged discretely. FIGS. 58A and 58B show an example of frame structure in the time and frequency domains that differs from FIGS. 47A, 47B, 48A, 48B, 51, 55A, and 55B. FIGS. 58A and 58B show the frame structure for carriers 1 through H, times $1 through $K. Elements that are similar to FIGS. 55A and 55B bear the same reference signs. Among the data symbols in FIGS. 58A and 58B, the “A” symbols are symbols in carrier group A, the “B” symbols are symbols in carrier group B, the “C” symbols are symbols in carrier group C, and the “D” symbols are symbols in carrier group D. The carrier groups can thus be similarly implemented by discrete arrangement along (sub)carriers, and the same carrier need not always be used in the time domain. This type of arrangement yields the advantageous effect of obtaining time and frequency diversity gain.

In FIGS. 47A, 47B, 48A, 48B, 51, 58A, and 58B, the control information symbols and the individual control information symbols are allocated to the same time in each carrier group, but these symbols may be allocated to different times. Furthermore, the number of (sub)carriers used by a carrier group may change over time.

Embodiment 16

Like Embodiment 10, the present embodiment describes a method for regularly hopping between precoding matrices using a unitary matrix when N is an odd number.

In the method of regularly hopping between precoding matrices over a period (cycle) with 2N slots, the precoding matrices prepared for the 2N slots are represented as follows.

Math 294

$\begin{matrix} {{{{for}\mspace{14mu} i} = 0},1,2,\ldots\mspace{14mu},{N - 2},{{{N - 1}:{F\lbrack i\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} e^{j\;{\theta_{11}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{11}{(i)}} + \lambda})}}} \\ {\alpha \times e^{j\;{\theta_{21}{(i)}}}} & e^{j\;{({{\theta_{21}{(i)}} + \lambda + \pi})}} \end{pmatrix}}}} & {{Equation}\mspace{20mu} 253} \end{matrix}$

Let α be a fixed value (not depending on i), where α>0.

Math 295

$\begin{matrix} {{{{for}\mspace{14mu} i} = N},{N + 1},{N + 2},\ldots\mspace{14mu},{{2N} - 2},{{{{2N} - 1}:{F\lbrack i\rbrack}} = {\frac{1}{\sqrt{\alpha^{2} + 1}}\begin{pmatrix} {\alpha \times e^{j\;{\theta_{11}{(i)}}}} & e^{j\;{({{\theta_{11}{(i)}} + \lambda})}} \\ e^{j\;{\theta_{21}{(i)}}} & {\alpha \times e^{j\;{({{\theta_{21}{(i)}} + \lambda + \pi})}}} \end{pmatrix}}}} & {{Equation}\mspace{14mu} 254} \end{matrix}$

Let α be a fixed value (not depending on i), where α>0. (Let the α in Equation 253 and the α in Equation 254 be the same value.)

From Condition #5 (Math 106) and Condition #6 (Math 107) in Embodiment 3, the following conditions are important in Equation 253 for achieving excellent data reception quality.

Math 296

Condition #46 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Math 297

Condition #47 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=0,1,2, . . . ,N−2,N−1)

(x is 0, 1, 2, . . . , N−2, N−1; y is 0, 1, 2, . . . , N−2, N−1; and x≠y.)

Addition of the following condition is considered.

Math 298

Condition #48 θ₁₁(x)−θ₁₁(x+N) for ∀x(x=0,1,2, . . . ,N−2,N−1) and θ₂₁(y)=θ₂₁(y+N) for ∀y(y=0,1,2, . . . ,N−2,N−1)

Next, in order to distribute the poor reception points evenly with regards to phase in the complex plane, as described in Embodiment 6, Condition #49 and Condition #50 are provided.

Math 299

Condition #49

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{(\frac{2\pi}{N})}}\mspace{14mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$ Math 300 Condition #50

$\frac{e^{j{({{\theta_{11}{({x + 1})}} - {\theta_{21}{({x + 1})}}})}}}{e^{j{({{\theta_{11}{(x)}} - {\theta_{21}{(x)}}})}}} = {e^{j{({- \frac{2\pi}{N}})}}\mspace{14mu}{for}\mspace{14mu}{\forall{x\left( {{x = 0},1,2,\ldots\mspace{14mu},{N - 2}} \right)}}}$

In other words, Condition #49 means that the difference in phase is 2π/N radians. On the other hand, Condition #50 means that the difference in phase is −2π/N radians.

Letting θ₁₁(0)−θ₂₁(0)=0 radians, and letting α>1, the distribution of poor reception points for s1 and for s2 in the complex plane for N=3 is shown in FIGS. 60A and 60B. As is clear from FIGS. 60A and 60B, in the complex plane, the minimum distance between poor reception points for s1 is kept large, and similarly, the minimum distance between poor reception points for s2 is also kept large. Similar conditions are created when α<1. Furthermore, upon comparison with FIGS. 45A and 45B in Embodiment 10, making the same considerations as in Embodiment 9, the probability of a greater distance between poor reception points in the complex plane increases when N is an odd number as compared to when N is an even number. However, when N is small, for example when N≤16, the minimum distance between poor reception points in the complex plane can be guaranteed to be a certain length, since the number of poor reception points is small. Accordingly, when N≤16, even if N is an even number, cases do exist where data reception quality can be guaranteed.

Therefore, in the method for regularly hopping between precoding matrices based on Equations 253 and 254, when N is set to an odd number, the probability of improving data reception quality is high. Precoding matrices F[0]-F[2N−1] are generated based on Equations 253 and 254 (the precoding matrices F[0]-F[2N−1] may be in any order for the 2N slots in the period (cycle)). Symbol number 2Ni may be precoded using F[0], symbol number 2Ni+1 may be precoded using F[1], . . . , and symbol number 2N×i+h may be precoded using F[h], for example (h=0, 1, 2, . . . , 2N−2, 2N−1). (In this case, as described in previous embodiments, precoding matrices need not be hopped between regularly.) Furthermore, when the modulation method for both s1 and s2 is 16QAM, if a is set as in Equation 233, the advantageous effect of increasing the minimum distance between 16×16=256 signal points in the IQ plane for a specific LOS environment may be achieved.

The following conditions are possible as conditions differing from Condition #48:

Math 301

Condition #51 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x))) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y))) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N−2, 2N−1; and x≠y.)

Math 302

Condition #52 e ^(j(θ) ¹¹ ^((x)−θ) ²¹ ^((x)−π)) ≠e ^(j(θ) ¹¹ ^((y)−θ) ²¹ ^((y)−π)) for ∀x,∀y(x≠y;x,y=N,N+1,N+2, . . . ,2N−2,2N−1)

(where x is N, N+1, N+2, . . . , 2N−2, 2N−1; y is N, N+1, N+2, . . . , 2N—2, 2N−1; and x≠y.)

In this case, by satisfying Condition #46, Condition #47, Condition #51, and Condition #52, the distance in the complex plane between poor reception points for s1 is increased, as is the distance between poor reception points for s2, thereby achieving excellent data reception quality.

In the present embodiment, the method of structuring 2N different precoding matrices for a precoding hopping method with a 2N-slot time period (cycle) has been described. In this case, as the 2N different precoding matrices, F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] are prepared. In the present embodiment, an example of a single carrier transmission method has been described, and therefore the case of arranging symbols in the order F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] in the time domain (or the frequency domain) has been described. The present invention is not, however, limited in this way, and the 2N different precoding matrices F[0], F[1], F[2], . . . , F[2N−2], F[2N−1] generated in the present embodiment may be adapted to a multi-carrier transmission method such as an OFDM transmission method or the like. As in Embodiment 1, as a method of adaption in this case, precoding weights may be changed by arranging symbols in the frequency domain and in the frequency-time domain. Note that a precoding hopping method with a 2N-slot time period (cycle) has been described, but the same advantageous effects may be obtained by randomly using 2N different precoding matrices. In other words, the 2N different precoding matrices do not necessarily need to be used in a regular period (cycle).

Furthermore, in the precoding matrix hopping method over an H-slot period (cycle) (H being a natural number larger than the number of slots 2N in the period (cycle) of the above method of regularly hopping between precoding matrices), when the 2N different precoding matrices of the present embodiment are included, the probability of excellent reception quality increases.

Embodiment 17

Embodiment 17 describes an arrangement of precoded symbols that achieves high reception quality in a transmission method for a MIMO system for regularly hopping between precoding matrices.

FIGS. 61A and 61B show an example of the frame structure of a portion of the symbols in a signal in the time-frequency domains when using a multi-carrier method, such as an OFDM method, in the transmission method that regularly hops between precoding matrices. FIG. 61A shows the frame structure of a modulated signal z1, and FIG. 61B shows the frame structure of a modulated signal z2. In both of these figures, one square represents one symbol.

In modulated symbol z1 and modulated symbol z2 of FIG. 61A and FIG. 61B, symbols that are allocated to the same carrier number are transmitted by a plurality of antennas of the transmission device at the same time over the same frequency.

The following focuses on symbol 610 a in carrier f2 and at time t2 of FIG. 61A. Note that while the term “carrier” is used here, the term “subcarrier” may also be used.

In carrier f2, an extremely high correlation exists between the channel conditions of the closest symbols in terms of time to time t2, i.e. symbol 613 a at time t1 and symbol 611 a at time t3 in carrier f2, and the channel conditions of symbol 610 a at time t2 in carrier f2.

Similarly, at time t2, an extremely high correlation exists between the channel conditions of the symbols at the closest frequencies to carrier f2 in the frequency domain, i.e. symbol 612 a at time t2 in carrier f1 and symbol 614 a at time t2 in carrier f3, and the channel conditions of symbol 610 a at time t2 in carrier f2.

As described above, an extremely high correlation exists between the channel conditions of symbols 611 a, 612 a, 613 a, and 614 a and the channel conditions of symbol 610 a.

Note that the same correlations of course exist for symbols 610 b-614 b of modulated signal z2.

In the present description, N types of matrices (where N is an integer equal to or greater than five) are used as the precoding matrices in the transmission method that regularly hops between precoding matrices. The symbols shown in FIGS. 61A and 61B bear labels such as “#1”, for example, which indicates that the symbol has been precoded with precoding matrix #1. In other words, precoding matrices #1-#N are prepared. Accordingly, the symbol bearing the label “#N” has been precoded with precoding matrix #N.

The present embodiment discloses utilization of the high correlation between the channel conditions of symbols that are adjacent in the frequency domain and symbols that are adjacent in the time domain in an arrangement of precoded symbols that yields high reception quality at the reception device.

The condition (referred to as Condition #53) for obtaining high reception quality at the reception side is as follows.

Condition #53

In a transmission method that regularly hops between precoding matrices, when using a multi-carrier transmission method such as OFDM, the following five symbols for data transmission (hereinafter referred to as data symbols) are each precoded with a different precoding matrix: the data symbol at time X in carrier Y; the symbols that are adjacent in the time domain, namely the data symbols at time X−1 in carrier Y and at time X+1 in carrier Y; and the symbols that are adjacent in the frequency domain, namely the data symbols at time X in carrier Y−1 and at time X in carrier Y+1.

The reason behind Condition #53 is as follows. For a given symbol in the transmission signal (hereinafter referred to as symbol A), a high correlation exists between (i) the channel conditions of symbol A and (ii) the channel conditions of the symbols adjacent to symbol A in terms of time and the symbols adjacent to symbol A in terms of frequency, as described above.

By using different precoding matrices for these five symbols, in an LOS environment, even if the reception quality of symbol A is poor (although the reception quality is high in terms of SNR, the condition of the phase relationship of the direct waves is poor, causing poor reception quality), the probability of excellent reception quality in the remaining four symbols adjacent to symbol A is extremely high. Therefore, after error correction decoding, excellent reception quality is obtained.

On the other hand, if the same precoding matrix as symbol A is used for the symbols adjacent to symbol A in terms of time or adjacent in terms of frequency, the symbols precoded with the same precoding matrix have an extremely high probability of poor reception quality like symbol A. Therefore, after error correction decoding, the data reception quality degrades.

FIGS. 61A and 61B show an example of symbol arrangement for obtaining this high reception quality, whereas FIGS. 62A and 62B show an example of symbol arrangement in which reception quality degrades.

As is clear from FIG. 61A, the precoding matrix used for symbol 610 a, which corresponds to symbol A, the precoding matrices used for symbols 611 a and 613 a, which are adjacent in terms of time to symbol 610 a, and the precoding matrices used for symbols 612 a and 614 a, which are adjacent in terms of frequency to symbol 610 a, are chosen to all differ from each other. In this way, even if the reception quality of symbol 610 a is poor at the receiving end, the reception quality of the adjacent symbols is extremely high, thus guaranteeing high reception quality after error correction decoding. Note that the same can be said for the modulated signal z2 in FIG. 61B.

On the other hand, as is clear from FIG. 62A, the precoding matrix used for symbol 620 a, which corresponds to symbol A, and the precoding matrix used for symbol 624 a, which is adjacent to symbol A in terms of frequency, are the same precoding matrix. In this case, if the reception quality for symbol 620 a at the receiving end is poor, the probability is high that the reception quality for symbol 624 a, which used the same precoding matrix, is also poor, causing reception quality after error correction decoding to degrade. Note that the same can be said for the modulated signal z2 in FIG. 62B.

Therefore, in order for the reception device to achieve excellent data reception quality, it is important for symbols that satisfy Condition #53 to exist. In order to improve the data reception quality, it is therefore preferable that many data symbols satisfy Condition #53.

The following describes a method of allocating precoding matrices to symbols that satisfy Condition #53.

Based on the above considerations, the following shows a method of allocating symbols so that all of the data symbols satisfy the symbol allocation shown in FIGS. 61A and 61B. One important condition (method of structuring) is the following Condition #54.

Condition #54

Five or more precoding matrices are necessary. As shown in FIGS. 61A and 61B, at least the precoding matrices that are multiplied with the five symbols arranged in the shape of a cross are necessary. In other words, the number N of different precoding matrices that satisfy Condition #53 must be five or greater. Stated another way, the period (cycle) of precoding matrices must have at least five slots.

When this condition is satisfied, it is possible to arrange symbols satisfying Condition #53 by allocating precoding matrices based on the following method and then precoding symbols.

First, in the frequency bandwidth that is to be used, one of N precoding matrices is allocated to the smallest carrier number and the smallest time (the earliest time from the start of transmission). As an example, in FIG. 63A, precoding matrix #1 is allocated to carrier f1, time t1. In the frequency domain, the index of the precoding matrix used for precoding is then changed one at a time (i.e. incremented). Note that the “index” in this context is used to distinguish between precoding matrices. In the method of regularly hopping between precoding matrices, a period (cycle) exists, and the precoding matrices that are used are arranged cyclically. In other words, focusing on time t1 in FIG. 63A, since the precoding matrix with index #1 is used in carrier f1, the precoding matrix with index #2 is used in carrier f2, the precoding matrix with index #3 is used in carrier f3, the precoding matrix with index #4 is used in carrier f4, the precoding matrix with index #5 is used in carrier f5, the precoding matrix with index #1 is used in carrier f6, the precoding matrix with index #2 is used in carrier f7, the precoding matrix with index #3 is used in carrier f8, the precoding matrix with index #4 is used in carrier f9, the precoding matrix with index #5 is used in carrier f10, the precoding matrix with index #1 is used in carrier f11, and so forth.

Next, using the smallest carrier number as a reference, the index of the precoding matrix allocated to the smallest carrier number (i.e. #X) is shifted in the time domain by a predetermined number (hereinafter, this predetermined number is indicated as Sc). Shifting is synonymous with increasing the index by Sc. At times other than the smallest time, the index of the precoding matrix used for precoding is changed (incremented) in the frequency domain according to the same rule as for the smallest time. In this context, when numbers from 1 to N are assigned to the prepared precoding matrices, shifting refers to allocating precoding matrices with numbers that are incremented with respect to the numbers of the precoding matrices allocated to the previous time slot in the time domain.

For example, focusing on time t2 in FIG. 63A, the precoding matrix with index #4 is allocated to carrier f1, the precoding matrix with index #5 to carrier f2, the precoding matrix with index #1 to carrier f3, the precoding matrix with index #2 to carrier f4, the precoding matrix with index #3 to carrier f5, the precoding matrix with index #4 to carrier f6, the precoding matrix with index #5 to carrier f7, the precoding matrix with index #1 to carrier f8, the precoding matrix with index #2 to carrier f9, the precoding matrix with index #3 to carrier f10, the precoding matrix with index #4 to carrier f11, and so forth. Accordingly, different precoding matrices are used in the same carrier at time t1 and time t2.

In order to satisfy Condition #53, the value of Sc for shifting the precoding matrices in the time domain is given by Condition #55.

Condition #55

Sc is between two and N−2, inclusive.

In other words, when precoding matrix #1 is allocated to the symbol in carrier f1 at time t1, the precoding matrices allocated in the time domain are shifted by Sc. That is, the symbol in carrier f1 at time t2 has the precoding matrix indicated by the number 1+Sc allocated thereto, the symbol in carrier f1 at time t3 has the precoding matrix indicated by the number 1+Sc+Sc allocated thereto, . . . , the symbol in carrier f1 at time tn has allocated thereto the precoding matrix indicated by Sc+(the number of the precoding matrix allocated to the symbol at time tn−1), and so forth. Note that when the value obtained by addition exceeds the prepared number N of different precoding matrices, N is subtracted from the value obtained by addition to yield the precoding matrix that is used. Specifically, letting N be five, Sc be two, and precoding matrix #1 be allocated to the smallest carrier f1 at time t1, the precoding matrix in carrier f1 at time t2 is precoding matrix #3 (1+2(Sc)), the precoding matrix in carrier f1 at time t3 is precoding matrix #5 (3+2(Sc)), the precoding matrix in carrier f1 at time t4 is precoding matrix #2 (5+2(Sc)−5(N)), and so forth.

Once the precoding matrices allocated to each time tx for the smallest carrier number are determined, the precoding matrices allocated in the smallest carrier number at each time are incremented to allocate subsequent precoding matrices. For example, in FIG. 63A, when the precoding matrix used for the symbol in carrier f1 at time t1 is precoding matrix #1, then the precoding matrices that symbols are multiplied by are allocated as follows: the precoding matrix used for the symbol in carrier f2 at time t1 is precoding matrix #2, the precoding matrix used for the symbol in carrier f3 at time t1 is precoding matrix #3, . . . . Note that in the frequency domain as well, when the number allocated to the precoding matrix reaches N, the number returns to one, thus forming a loop.

FIGS. 63A and 63B thus show an example of symbol arrangement for data symbols precoded with the precoding matrix allocated thereto. For the modulated signal z1 shown in FIG. 63A and the modulated signal z2 shown in FIG. 63B, an example of symbol arrangement is shown in which five precoding matrices are prepared, and three is used as the above incremental value Sc.

As is clear from FIGS. 63A and 63B, data symbols are arranged after being precoded using precoding matrices whose numbers are shifted in accordance with the above method. As is also clear from FIGS. 63A and 63B, in this arrangement the above Condition #53 is satisfied, since when focusing on a data symbol in any position, the precoding matrix used for the data symbol and the precoding matrices used for the data symbols that are adjacent thereto in the frequency and time domains are all different. However, in the case of a data symbol A for which there are three or fewer data symbols adjacent thereto in the frequency and time domains, the number of adjacent data symbols being X (where X is equal to or less than three), then different precoding matrices are used for the X adjacent data symbols and the data symbol A. For example, in FIG. 63A, the data symbol at f1, t1 only has two adjacent data symbols, the data symbol at f1, t2 only has three adjacent data symbols, and the data symbol at f2, t1 only has three adjacent data symbols. For each of these data symbols as well, however, different precoding matrices are allocated to the data symbol and the adjacent data symbols.

Furthermore, it is clear that the index of precoding matrices is increased by a value of three for Sc, since the difference between the index of the precoding matrix used for symbol 631 a and the precoding matrix used for symbol 630 a in FIG. 63A is 4−1=3, and the difference between the index of the precoding matrix used for symbol 632 a and the precoding matrix used for symbol 631 a in FIG. 63A is 2+5−4=3. This value of Sc is within the range 2≤Sc≤3(5(N)−2), thus satisfying Condition #55.

FIGS. 64A and 64B show an example of symbol arrangement with five precoding matrices and two as the above incremental value Sc.

In the transmission device, as an example of the method for achieving this symbol arrangement, the precoding matrix with the smallest number (precoding matrix #1 in FIGS. 63A and 63B) is allocated as the precoding matrix used for the symbol in the smallest carrier (for example, carrier f1 in FIGS. 63A and 63B) when precoding the data symbols. The number of the precoding matrix allocated to the smallest carrier, precoding matrix #1, is then shifted in the time domain by the predetermined number Sc in order to allocate precoding matrices. For this method, a register indicating the predetermined value of Sc is provided, and the value set in the register is added to the number of the allocated precoding matrix.

After allocating precoding matrices to the smallest carrier for the necessary number of time slots, the precoding matrix allocated to each time slot should be incremented one at a time in the frequency domain until reaching the largest carrier that is used.

In other words, a structure should be adopted in which the number of the precoding matrices used in the frequency domain is incremented one at a time, whereas the number of the precoding matrices used in the time domain is shifted by Sc.

For the modulated signal z1 shown in FIGS. 63A and 64A and the modulated signal z2 shown in FIGS. 63B and 64B, symbols are arranged after being precoded using precoding matrices whose numbers are shifted in accordance with the above method, and it is clear that when focusing on any of the symbols, Condition #53 is satisfied.

By transmitting signals generated in this way, at the reception device, even if the reception quality of a certain symbol is poor, it is assumed that the reception quality of symbols that are adjacent in the frequency and time domains will be higher. Therefore, after error correction decoding, excellent reception quality is guaranteed.

In the above-described allocation method of precoding matrices, the smallest carrier is determined, and precoding matrices are shifted by Sc in the time domain, but precoding matrices may be shifted by Sc in the frequency domain. In other words, after determining the precoding matrix allocated to the earliest time t1 in carrier f1, precoding matrices may be allocated by shifting the precoding matrix by Sc one carrier at a time in the frequency domain. In the same carrier, the index of each precoding matrix would then be incremented one at a time in the time domain. In this case, the symbol arrangements shown in FIGS. 63A, 63B, 64A, and 64B would become the symbol arrangements shown in FIGS. 65A, 65B, 66A, and 66B.

As shown in FIGS. 67A through 67D, a variety of methods exist for the order of incrementing the index of the precoding matrix, and any of these orders may be used. In FIGS. 67A through 67D, the index of the precoding matrices is incremented in the order of the numbers 1, 2, 3, 4, . . . assigned to the arrows.

FIG. 67A shows a method in which, as shown in FIGS. 63A, 63B, 64A, and 64B, the index of the precoding matrices used at time A is incremented in the frequency domain; when finished, the index of the precoding matrices used at time A+1 is incremented in the frequency domain; and so forth.

FIG. 67B shows a method in which, as described in FIGS. 63A, 63B, 64A, and 64B, the index of the precoding matrices used at frequency A is incremented in the time domain; when finished, the index of the precoding matrices used at frequency A+1 is incremented in the time domain; and so forth.

FIGS. 67B and 67D are modifications of FIGS. 67A and 67C respectively. The index of the precoding matrices that are used is incremented in the following way. First, the index of the precoding matrices used for the symbols indicated by arrow 1 is incremented in the direction of the arrow. When finished, the index of the precoding matrices used for the symbols indicated by arrow 2 is incremented in the direction of the arrow, and so forth.

For a method other than the methods shown in FIGS. 67A through 67D, it is preferable to implement a precoding method that results in many data symbols satisfying Condition #53, as in FIGS. 63A through 66B.

Note that precoding matrices may be incremented in accordance with a method other than the methods of incrementing the index of precoding matrices shown in FIGS. 67A through 67D, in which case a method yielding many data symbols satisfying Condition #53 is preferable.

Modulated signals generated in this way are transmitted from a plurality of antennas in the transmission device.

This concludes the example of arrangement of precoded symbols according to Embodiment 17 for reducing degradation of reception quality at the receiving end. Note that in Embodiment 17, methods have been shown in which many data symbols satisfy Condition #53 by using, in symbols adjacent to a certain symbol, precoding matrices whose number has been shifted by a predetermined number from the precoding matrix for the certain symbol. However, as long as data symbols satisfying Condition #53 exist, the advantageous effect of improved data reception quality can be achieved even without allocating precoding matrices regularly as shown in Embodiment 17.

Furthermore, in the method of the present embodiment, treating the symbol to which a precoding matrix is first allocated as a reference, precoding matrix #1 is allocated to the symbol in the smallest carrier, and the precoding matrices are shifted by one or by Sc in the frequency and time domains, but this method may be adapted to allocate precoding matrices starting from the largest carrier. Alternatively, a structure may be adopted whereby precoding matrix #N is allocated to the smallest carrier, and the precoding matrices are then shifted by subtraction. In other words, the index numbers of different precoding matrices in Embodiment 17 are only an example, and as long as many data symbols satisfy Condition #53, any index numbers may be assigned.

Information indicating the allocation method of precoding matrices shown in Embodiment 17 is generated by the weighting information generating unit 314 shown in Embodiment 1, and in accordance with the generated information, the weighting units 308A and 308B or the like perform precoding.

Additionally, while in the method of regularly hopping between precoding matrices, the number of precoding matrices used does not change (i.e., different precoding matrices F[0], F[1], . . . , F[N−1] are prepared, and the precoding matrices F[0], F[1], . . . , F[N−1] are hopped between and used), it is possible to switch between the method of allocating precoding matrices of the present embodiment and of other embodiments in units of frames, in units of symbol blocks composed of complex symbols, and the like. In this case, the transmission device transmits information regarding the method of allocating precoding matrices. By receiving this information, the reception device learns the method of allocating precoding matrices, and based on the method, decodes the precoded symbols. Predetermined methods of allocating the precoding matrices exist, such as allocation method A, allocation method B, allocation method C, and allocation method D. The transmission device selects an allocation method from among A-D and transmits information to the reception device to indicate which of the methods A-D is used. By acquiring this information, the reception device is able to decode the precoded symbols.

Note that in the present embodiment, the case of transmitting modulated signals s1, s2 and z1, z2 has been described, i.e. an example of two streams and two transmission signals. The number of streams and of transmission signals is not limited in this way, however, and precoding matrices may be similarly allocated when the number is larger than two. In other words, if streams of modulated signals s3, s4, . . . exist, and transmission signals for the modulated signals z3, z4, . . . exist, then in z3 and z4, the index of the precoding matrices for the symbols in frames in the frequency-time domains may be changed similarly to z1 and z2.

Embodiment 18

In Embodiment 17, conditions when allocating only data symbols have been described. In practice, however, pilot symbols and symbols for transmitting control information can also be thought to exist. (While the term “pilot symbol” is used here, an appropriate example is a known PSK modulation symbol that does not transmit data, and a name such as “reference symbol” may be used. Typically, this symbol is used for estimation of channel conditions, estimation of frequency offset amount, acquisition of synchronization of time, signal detection, estimation of phase distortion, and the like.) Therefore, Embodiment 18 describes a method of allocating precoding matrices for data symbols among which pilot symbols are inserted.

In Embodiment 17, FIGS. 63A, 63B, 64A, 64B, 65A, 65B, 66A, and 66B show an example in which no pilot symbols or symbols for transmitting control information are allocated at the time when data symbols are allocated. In this case, letting the starting time at which data symbols are allocated be t1, pilot symbols or symbols for transmitting control information may be allocated before t1 (in this case, such symbols may be referred to as a preamble). Furthermore, in order to improve data reception quality in the reception device, pilot symbols may be allocated at the time after the last time at which data symbols are allocated (see FIG. 68A). Note that FIG. 68A shows the case in which pilot symbols (P) occur, but as described above, these pilot symbols (P) may be replaced by symbols (C) for transmitting control information.

Furthermore, pilot symbols or symbols for transmitting control information, which are not data symbols, may be allocated to a specific carrier. As an example, FIG. 68B shows arrangement of pilot symbols in the carriers at either end of the frequency domain. Even with this arrangement, many data symbols satisfying Condition #53 may be provided as in Embodiment 17. Furthermore, it is not necessary as in FIG. 68B for pilot symbols to be arranged at either end of the frequencies used for data symbols in the frequency domain. For example, pilot symbols (P) may be arranged in a specific carrier as in FIG. 68C, or instead of pilot symbols, control information (C) may be arranged in a specific carrier, as in FIG. 68D. Even with the arrangements in FIGS. 68C and 68D, many data symbols satisfying Condition #53 may be provided as in Embodiment 17. Note that in FIGS. 68A through 68D, no difference is made between modulated signals, since this description holds for both modulated signals z1 and z2.

In other words, even if symbols that are not data symbols, such as pilot symbols or symbols for transmitting control information, are arranged in specific carriers, many data symbols satisfying Condition #53 may be provided. Furthermore, as described above, in FIGS. 68A through 68D, even if symbols that are not data symbols, such as pilot symbols or symbols for transmitting control information, are arranged before the time when data symbols are first arranged, i.e. before time t1, many data symbols satisfying Condition #53 may be provided.

Additionally, even if only symbols other than data symbols are arranged at a specific time instead of data symbols, many data symbols satisfying Condition #53 may be provided.

Note that in FIGS. 68A through 68D, the case of pilot symbols in both modulated signals z1 and z2 at the same time and in the same carrier has been described, but the present invention is not limited in this way. For example, a structure may be adopted in which a pilot symbol is provided in modulated signal z1 whereas a symbol with in-phase components I of zero and quadrature-phase components Q of zero is provided in modulated signal z2. Conversely, a structure may be adopted in which a symbol with in-phase components I of zero and quadrature-phase components Q of zero is provided in modulated signal z1, whereas a pilot symbol is provided in modulated signal z2.

In the frames in the time-frequency domains described so far, a frame structure in which symbols other than data symbols only occur at specified times or in specified carriers has been described. As an example differing from these examples, the following describes the case in which the subcarrier including a pilot symbol P changes over time, as shown in FIGS. 69A and 69B. In particular, the following describes a method of allocating precoding matrices so that precoded data symbols that are located in the positions shown in FIGS. 69A and 69B (the squares not labeled P) satisfy Condition #53 of Embodiment 17. Note that, as in the above description, the case of pilot symbols in both modulated signals z1 and z2 at the same time and in the same carrier is described, but the present invention is not limited in this way. For example, a structure may be adopted in which a pilot symbol is provided in modulated signal z1 whereas a symbol with in-phase components I of zero and quadrature-phase components Q of zero is provided in modulated signal z2. Conversely, a structure may be adopted in which a symbol with in-phase components I of zero and quadrature-phase components Q of zero is provided in modulated signal z1, whereas a pilot symbol is provided in modulated signal z2.

First, when the index of the precoding matrix that is used is simply incremented as described in Embodiment 17, one possibility is not to increment the index of the precoding matrix for symbols other than data symbols. FIGS. 70A and 70B show an example of symbol arrangement in this case. In FIGS. 70A and 70B, as in FIG. 67A, the method is adopted whereby the index of precoding matrices is incremented in the frequency domain and is shifted by Sc in the time domain. In this case, when the index of the precoding matrices is incremented in the frequency domain, for symbols other than data symbols, the index of the precoding matrix is not incremented. Adopting this structure in the method of regularly hopping between precoding matrices offers the advantage of maintaining a constant period (cycle) and of providing data symbols that satisfy Condition #53.

In particular, when the following conditions are satisfied, many data symbols satisfying Condition #53 can be provided.

<a> In time slots i−1, i, and i+1, in which data symbols exist, letting the number of pilot symbols existing at time i−1 be A, the number of pilot symbols existing at time i be B, and the number of pilot symbols existing at time i+1 be C, the difference between A and B is 0 or 1, the difference between B and C is 0 or 1, and the difference between A and C is 0 or 1.

Condition <a> may also be expressed as follows.

<a′> In time slots i−1, i, and i+1, in which data symbols exist, letting the number of data symbols existing at time i−1 be α, the number of data symbols existing at time i be β, and the number of data symbols existing at time i+1 be γ, the difference between α and β is 0 or 1, the difference between β and γ is 0 or 1, and the difference between α and γ is 0 or 1.

Relaxing the conditions in conditions <a> and <a′> yields the following.

<b> In time slots i−1, i, and i+1, in which data symbols exist, letting the number of pilot symbols existing at time i−1 be A, the number of pilot symbols existing at time i be B, and the number of pilot symbols existing at time i+1 be C, the difference between A and B is 0, 1, or 2, the difference between B and C is 0, 1, or 2, and the difference between A and C is 0, 1, or 2. <b′> In time slots i−1, i, and i+1, in which data symbols exist, letting the number of data symbols existing at time i−1 be α, the number of data symbols existing at time i be β, and the number of data symbols existing at time i+1 be γ,

the difference between α and β is 0, 1, or 2, the difference between β and γ is 0, 1, or 2, and the difference between α and γ is 0, 1, or 2.

It is preferable to use a large period (cycle) in the method of regularly hopping between precoding matrices, and for the value of Sc to be “equal to or greater than X and less than or equal to N−X, where X is large”.

With these conditions, selecting any two of (i) the number of times the index of the precoding matrices is incremented at time i−1, (ii) the number of times the index of the precoding matrices is incremented at time i, and (iii) the number of times the index of the precoding matrices is incremented at time i+1, the difference therebetween is at most one. Therefore, the probability of maintaining the conditions described in Embodiment 17 is high.

Focusing on symbol 700 a in FIG. 70A, however, indicates that this data symbol does not satisfy Condition #53, which requires that the precoding matrix used in symbol 700 a and the precoding matrices used in the symbols adjacent to symbol 700 a in the frequency and time domains all be different. A small number of data symbols like symbol 700 a do exist. (In FIG. 70A, the reason many data symbols satisfy Condition #53 is that the above conditions are satisfied. Furthermore, depending on the method of allocation, it is possible for all data symbols having adjacent data symbols to satisfy Condition #53. Embodiment 20 shows an example such allocation.)

Another method is to increment the index number of precoding matrices even at locations where pilot symbols are inserted.

FIGS. 71A and 71B show a method of allocating precoding matrices when the pilot symbols of the present embodiment are inserted in the example of the method of allocating precoding matrices for data symbols shown in FIGS. 63A and 63B.

As shown in FIGS. 71A and 71B, at each location where a pilot symbol is allocated, a data symbol is assumed to exist for the purpose of allocating a precoding matrix. In other words, precoding matrices are allocated as in Embodiment 17, resulting in deletion of the number of the precoding matrix used at a position where a pilot symbol is located.

This arrangement offers the advantageous effect that all of the data symbols in the time and frequency domains satisfy Condition #53. However, since pilot symbols are inserted, the period (cycle) in the method of regularly hopping between precoding matrices is no longer constant.

Information indicating the allocation method of precoding matrices shown in Embodiment 18 may be generated by the weighting information generating unit 314 shown in Embodiment 1, and in accordance with the generated information, the weighting units 308A and 308B or the like may perform precoding and transmit information corresponding to the above information to the communication partner. (This information need not be transmitted when a rule is predetermined, i.e. when the method of allocating precoding matrices is determined in advance at the transmission side and the reception side.) The communication partner learns of the allocation method of precoding matrices used by the transmission device and, based on this knowledge, decodes precoded symbols.

In the present embodiment, the case of transmitting modulated signals s1, s2 and modulated signals z1, z2 has been described, i.e. an example of two streams and two transmission signals. The number of streams and of transmission signals is not limited in this way, however, and may similarly be implemented by allocating precoding matrices when the number is larger than two. In other words, if streams of modulated signals s3, s4, . . . exist, and transmission signals z3, z4, . . . exist, then in z3 and z4, the index of the precoding matrices for the symbols in frames in the frequency-time domains may be allocated similarly to the modulated signals z1 and z2.

Embodiment 19

Embodiment 17 and Embodiment 18 describe an example focusing on five data symbols, namely a certain data symbol and the symbols that are closest to the certain data symbol in terms of time and frequency, wherein the precoding matrices assigned to the five data symbols are all different. Embodiment 19 describes a method for allocating precoding matrices that expands the range over which precoding matrices used for nearby data symbols differ from each other. Note that in the present embodiment, a range over which precoding matrices allocated to all of the symbols in the range differ is referred to as a “differing range” for the sake of convenience.

In Embodiments 17 and 18, precoding matrices are allocated so that, for five data symbols in the shape of a cross, the precoding matrices used for the data symbols differ from each other. In this embodiment, however, the range over which precoding matrices that differ from each other are allocated to data symbols is expanded, for example to three symbols in the direction of frequency and three symbols in the time domain, for a total of 3×3=9 data symbols. Precoding matrices that differ from each other are allocated to these nine data symbols. With this method, the data reception quality at the reception side may be higher than the symbol arrangement shown in Embodiment 17 in which only five symbols are multiplied by different precoding matrices. (As mentioned above, the present embodiment describes the case of expansion to M symbols in the time domain and N symbols in the frequency domain, i.e. N×M data symbols.)

The following describes a method of allocating precoding matrices by describing this expansion, and subsequently, conditions for achieving the expansion.

FIGS. 72A through 78B show examples of frame structure and of expanded arrangements of symbols multiplied by mutually different precoding matrices.

FIGS. 72A, 72B, 73A, and 73B show examples of frame structure of a modulated signal with a differing range of 3×3. FIGS. 75A and 75B show expansion of the differing range to 3×5. FIGS. 77A and 77B show an example of a diamond-like range.

First, in the rectangular differing ranges shown in FIGS. 72A, 72B, 73A, 73B, 75A, and 75B, the minimum necessary number of different precoding matrices equals the number of symbols included in the differing range. In other words, the minimum number of different precoding matrices is the product of the number of symbols in the frequency domain and the number of symbols in the time domain in the differing range. (As shown in FIGS. 73A and 73B, a larger number of different precoding matrices than the minimum number may be prepared.) That is, letting the period (cycle) for hopping in the method of regularly hopping between precoding matrices be Z, the period (cycle) Z must have at least N×M slots.

Next, the following describes a specific example of a method of allocating precoding matrices in order to achieve an arrangement of symbols with the method of allocating precoding matrices shown in FIGS. 72A, 72B, 73A, and 73B.

First, the method of allocating precoding matrices in the frequency domain is to allocate precoding matrices by incrementing the index number one at a time, as described in Embodiment 17. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues.

When allocating precoded symbols in the time domain as well, precoding matrices are allocated by adding Sc, as described in Embodiment 17, yet the conditions for Sc differ from those described in Embodiment 17.

The conditions for Sc described in Embodiment 17 are, in the present embodiment, that when the differing range is expanded to N×M data symbols, i.e. M symbols in the time domain and N symbols in the frequency domain, then letting L be the larger of the values N and M, Sc is equal to or greater than L symbols and equal to or less than Z−L symbols. (Let the hopping period (cycle) in the method of regularly hopping between precoding matrices have Z slots.) However, when N M, the above condition need not be satisfied in some cases.

Note that when Sc is set to a larger number than L, a larger number of different precoding matrices than N×M is necessary for the value of Z. In other words, it is preferable to set the hopping period (cycle) to be large.

In the case of the 3×3 differing range in FIGS. 72A, 72B, 73A, and 73B, since L is 3, it is necessary for Sc to be an integer equal to or greater than 3 and equal to or less than Z−3.

In other words, when the precoding matrix used for the symbol in carrier f1 at time t1 is precoding matrix #1 and the differing range is 3×3, the precoding matrix used for the symbol in carrier f1 at time t2 is 1+3, i.e. precoding matrix #4.

FIGS. 74A and 74B show the arrangement of symbols in a modulated signal when implementing precoding after allocating precoding matrices with the differing range shown in FIGS. 72A and 72B. As is clear from FIGS. 74A and 74B, different precoding matrices are used for the symbols in the differing range at any location.

With reference to FIGS. 74A and 74B, the following structure has been described. Precoding matrices are allocated in the frequency domain by incrementing the index number of the precoding matrices one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the time domain, precoding matrices are allocated by adding Sc, as also described in Embodiment 17. However, as in Embodiment 17, the present invention may be similarly implemented by thinking of the vertical axis as frequency and the horizontal axis as time in FIGS. 74A and 74B. Precoding matrices are then allocated in the time domain by incrementing the index number of the precoding matrices one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the frequency domain, precoding matrices are allocated by adding Sc, as also described in Embodiment 17. In this case as well, the above conditions of Sc are important.

FIGS. 75A and 75B show examples of frame structure with a differing range of 3×5, and FIGS. 76A and 76B show the arrangement of symbols in a modulated signal that are precoded with these frame structures.

As is clear from FIGS. 76A and 76B, the precoding matrices allocated in the time domain are shifted by three symbols in the frequency domain in the differing range. Furthermore, in FIGS. 76A and 76B, precoding matrices that are all different from each other are allocated to the symbols in the differing range at any location.

From the examples in FIGS. 76A and 76B, the conditions on Sc described in Embodiment 17 can be thought of as follows when the differing range is expanded to N×M data symbols, i.e. M symbols in the time domain and N symbols in the frequency domain, and when N≠M.

Let the index number of precoding matrices in the frequency domain be incremented one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the time domain, precoding matrices are allocated by adding Sc, as described in Embodiment 17. In this case, Sc must be equal to or greater than N symbols and equal to or less than Z−N. (Let the hopping period (cycle) in the method of regularly hopping between precoding matrices have Z slots.)

However, even when Sc is set according to the above conditions, in some cases the precoding matrices allocated to the symbols in the differing range may not all be different. To achieve a structure in which all of the precoding matrices allocated to the symbols in the differing range are different, the size of the hopping period (cycle) should be set to a large number.

Let the index number of precoding matrices in the time domain be incremented one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the frequency domain, precoding matrices are allocated by adding Sc, as described in Embodiment 17. In this case, Sc must be equal to or greater than M symbols and equal to or less than Z−M.

However, even when Sc is set according to the above conditions, in some cases the precoding matrices allocated to the symbols in the differing range may not all be different. To achieve a structure in which all of the precoding matrices allocated to the symbols in the differing range are different, the size of the hopping period (cycle) should be increased.

It is obvious that FIGS. 76A and 76B satisfy the above conditions. With reference to FIGS. 76A and 76B, the following case has been described. Precoding matrices are allocated in the frequency domain by incrementing the index number of the precoding matrices one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the time domain, precoding matrices are allocated by adding Sc, as also described in Embodiment 17. However, as in Embodiment 17, the present invention may be similarly implemented by thinking of the vertical axis as frequency and the horizontal axis as time in FIGS. 76A and 76B. Precoding matrices are then allocated in the time domain by incrementing the index number of the precoding matrices one at a time. When the index number exceeds the number of prepared precoding matrices, allocation returns to precoding matrix #1 and continues. When allocating precoded symbols in the frequency domain, precoding matrices are allocated by adding Sc, as also described in Embodiment 17. In this case as well, the above conditions of Sc are important.

Furthermore, while a structure has been described in which precoding matrices are shifted by Sc in the time domain and are shifted one at a time in the frequency domain, precoding matrices may be allocated by shifting precoding matrices one at a time in the time domain and by Sc in the frequency domain, as described in Embodiment 17 with reference to FIGS. 65A, 65B, 66A, and 66B.

Additionally, the precoding matrices used for all of the symbols in any differing range may differ from each other in a diamond-like differing range as well, as shown in FIGS. 77A and 77B.

In this case, however, in order to satisfy the above conditions, the necessary number of precoding matrices is the maximum number of symbols in the frequency domain multiplied by the maximum number of symbols in the time domain in the diamond-like differing range. In other words, in the diamond-like differing range shown in FIGS. 77A and 77B, in order to achieve an arrangement in which all of the precoding matrices used for all of the symbols differ from each other, 25 precoding matrices are necessary (5×5, i.e. the maximum number of symbols in the differing range in the frequency domain multiplied by the maximum number of symbols in the differing range in the time domain). Adopting such a diamond-like differing range is substantially equivalent to a symbol arrangement with a differing range yielded by the smallest rectangle that encloses the diamond-like differing range.

FIGS. 78A and 78B show actual symbol arrangements when allocating precoding matrices using the diamond-like differing range shown in FIGS. 77A and 77B. In FIGS. 78A and 78B, it is clear that all of the precoding matrices allocated to the symbols included in any diamond-like differing range differ from each other.

In this way, even when the range in which all of the precoding matrices allocated to symbols differ from each other is expanded from five symbols as shown in Embodiment 17, a method can be implemented to allocate precoding matrices while incrementing by one, and shifting by Sc, the index of the precoding matrices in the frequency and the time domains.

While conditions have been described when allocating only data symbols, as in Embodiment 17, the following describes the arrangement of data symbols when pilot symbols are inserted, as described in Embodiment 18.

One example of symbol arrangement when pilot symbols are inserted shares the concept described in Embodiment 18. Namely, since the locations at which pilot symbols are inserted are predetermined, at each location where a pilot symbol is inserted, the number of the precoding matrix that would be allocated if a pilot symbol were not inserted is skipped before multiplying the precoding matrix with the next symbol. In other words, at locations where pilot symbols are inserted, the number of the precoding matrix allocated to the next symbol is increased more. Specifically, when incrementing the index one at a time, the index of the precoding matrix is incremented by two over the precoding matrix allocated to the previous symbol, and when shifting by Sc, the index of the precoding matrix is increased by 2×Sc.

FIGS. 79A and 79B show examples of insertion of pilot symbols into the symbol arrangements shown in FIGS. 74A and 74B. As shown in FIGS. 79A and 79B, a method of allocating precoding matrices is implemented whereby, at positions where pilot symbols are inserted, the number of the precoding matrix that would have been allocated if a data symbol were present is skipped.

With this structure, a differing range that expands the range over which different precoding matrices are allocated is also compatible with insertion of pilot symbols.

Information indicating the allocation method of precoding matrices shown in Embodiment 17 may be generated by the weighting information generating unit 314 shown in Embodiment 1, and in accordance with the generated information, the weighting units 308A and 308B or the like may perform precoding and transmit information corresponding to the above information to the communication partner. (This information need not be transmitted when a rule is predetermined, i.e. when the method of allocating precoding matrices is determined in advance at the transmission side and the reception side.) The communication partner learns of the allocation method of precoding matrices used by the transmission device and, based on this knowledge, decodes precoded symbols.

In the present embodiment, the case of transmitting modulated signals s1, s2 and modulated signals z1, z2 has been described, i.e. an example of two streams and two transmission signals. The number of streams and of transmission signals is not limited in this way, however, and may similarly be implemented by allocating precoding matrices when the number is larger than two. In other words, if streams of modulated signals s3, s4, . . . exist, and transmission signals z3, z4, . . . exist, then in z3 and z4, the index of the precoding matrices for the symbols in frames in the frequency-time domains may be allocated similarly to the modulated signals z1 and z2.

Embodiment 20

Embodiment 18 describes the case of incrementing the index of the precoding matrix that is used, i.e. of not incrementing the index of the precoding matrix for symbols other than data symbols. In the present embodiment, FIGS. 80A, 80B, 81A, and 81B show the allocation of precoding matrices in a frame differing from the description of FIGS. 70A and 70B in Embodiment 18. Note that, similar to Embodiment 18, FIGS. 80A, 80B, 81A, and 81B show the frame structure in the time-frequency domains for modulated signals z1, z2, as well as pilot symbols, data symbols, and the index numbers of precoding matrices used for the data symbols. “P” indicates a pilot symbol, whereas other squares are data symbols. The #X for each data symbol indicates the index number of the precoding matrix that is used.

As compared to FIGS. 70A and 70B, FIGS. 80A and 80B show an example of a period (cycle) with a larger size and a larger value of Sc in the method of regularly hopping between precoding matrices. Furthermore, conditions <a>, <a′>, <b>, and <b′> described in Embodiment 18 are satisfied. With these conditions, the number of times that the precoding matrices are not incremented does not change over time. Therefore, not incrementing the precoding matrices has a reduced effect on the relationship between index numbers of the data symbols. Accordingly, all of the data symbols that have data symbols adjacent thereto satisfy Condition #53.

As another example, FIGS. 81A and 81B show a case not satisfying conditions <a>, <a′>, <b>, and <b′>. As is clear from 8100, for example, in FIGS. 81A and 81B, condition #53 is not satisfied. This is a result of the great impact caused by not satisfying the conditions described in Embodiment 18.

Embodiment B1

The following describes a structural example of an application of the transmission methods and reception methods shown in the above embodiments and a system using the application.

FIG. 82 shows an example of the structure of a system that includes devices implanting the transmission methods and reception methods described in the above embodiments. The transmission method and reception method described in the above embodiments are implemented in a digital broadcasting system 8200, as shown in FIG. 82, that includes a broadcasting station 8201 and a variety of reception devices such as a television 8211, a DVD recorder 8212, a Set Top Box (STB) 8213, a computer 8220, an in-car television 8241, and a mobile phone 8230. Specifically, the broadcasting station 8201 transmits multiplexed data, in which video data, audio data, and the like are multiplexed, using the transmission methods in the above embodiments over a predetermined broadcasting band.

An antenna (for example, antennas 8210 and 8240) internal to each reception device, or provided externally and connected to the reception device, receives the signal transmitted from the broadcasting station 8201. Each reception device obtains the multiplexed data by using the reception methods in the above embodiments to demodulate the signal received by the antenna. In this way, the digital broadcasting system 8200 obtains the advantageous effects of the present invention described in the above embodiments.

The video data included in the multiplexed data has been coded with a moving picture coding method compliant with a standard such as Moving Picture Experts Group (MPEG)2, MPEG4-Advanced Video Coding (AVC), VC-1, or the like. The audio data included in the multiplexed data has been encoded with an audio coding method compliant with a standard such as Dolby Audio Coding (AC)-3, Dolby Digital Plus, Meridian Lossless Packing (MLP), Digital Theater Systems (DTS), DTS-HD, Pulse Coding Modulation (PCM), or the like.

FIG. 83 is a schematic view illustrating an exemplary structure of a reception device 8300 for carrying out the reception methods described in the above embodiments. The reception device 8300 shown in FIG. 83 corresponds to a component that is included, for example, in the television 8211, the DVD recorder 8212, the STB 8213, the computer 8220, the in-car television 8241, the mobile phone 8230, or the like illustrated in FIG. 82. The reception device 8300 includes a tuner 8301, for transforming a high-frequency signal received by an antenna 8360 into a baseband signal, and a demodulation unit 8302, for demodulating multiplexed data from the baseband signal obtained by frequency conversion. The reception methods described in the above embodiments are implemented in the demodulation unit 8302, thus obtaining the advantageous effects of the present invention described in the above embodiments.

The reception device 8300 includes a stream input/output unit 8303, a signal processing unit 8304, an audio output unit 8306, and a video display unit 8307. The stream input/output unit 8303 demultiplexes video and audio data from multiplexed data obtained by the demodulation unit 8302. The signal processing unit 8304 decodes the demultiplexed video data into a video signal using an appropriate moving picture decoding method and decodes the demultiplexed audio data into an audio signal using an appropriate audio decoding method. The audio output unit 8306, such as a speaker, produces audio output according to the decoded audio signal. The video display unit 8307, such as a display monitor, produces video output according to the decoded video signal.

For example, the user may operate the remote control 8350 to select a channel (of a TV program or audio broadcast), so that information indicative of the selected channel is transmitted to an operation input unit 8310. In response, the reception device 8300 demodulates, from among signals received with the antenna 8360, a signal carried on the selected channel and applies error correction decoding, so that reception data is extracted. At this time, the receiving device 8300 receives control symbols included in a signal corresponding to the selected channel and containing information indicating the transmission method (the transmission method, modulation method, error correction method, and the like in the above embodiments) of the signal (exactly as shown in FIGS. 5 and 41). With this information, the reception device 8300 is enabled to make appropriate settings for the receiving operations, demodulation method, method of error correction decoding, and the like to duly receive data included in data symbols transmitted from a broadcasting station (base station). Although the above description is directed to an example in which the user selects a channel using the remote control 8350, the same description applies to an example in which the user selects a channel using a selection key provided on the reception device 8300.

With the above structure, the user can view a broadcast program that the reception device 8300 receives by the reception methods described in the above embodiments.

The reception device 8300 according to this embodiment may additionally include a recording unit (drive) 8308 for recording various data onto a recording medium, such as a magnetic disk, optical disc, or a non-volatile semiconductor memory. Examples of data to be recorded by the recording unit 8308 include data contained in multiplexed data that is obtained as a result of demodulation and error correction by the demodulation unit 8302, data equivalent to such data (for example, data obtained by compressing the data), and data obtained by processing the moving pictures and/or audio. (Note here that there may be a case where no error correction decoding is applied to a signal obtained as a result of demodulation by the demodulation unit 8302 and where the reception device 8300 conducts further signal processing after error correction decoding. The same holds in the following description where similar wording appears.) Note that the term “optical disc” used herein refers to a recording medium, such as Digital Versatile Disc (DVD) or BD (Blu-ray Disc), that is readable and writable with the use of a laser beam. Further, the term “magnetic disk” used herein refers to a recording medium, such as a floppy disk (FD, registered trademark) or hard disk, that is writable by magnetizing a magnetic substance with magnetic flux. Still further, the term “non-volatile semiconductor memory” refers to a recording medium, such as flash memory or ferroelectric random access memory, composed of semiconductor element(s). Specific examples of non-volatile semiconductor memory include an SD card using flash memory and a flash Solid State Drive (SSD). It should be naturally appreciated that the specific types of recording media mentioned herein are merely examples, and any other types of recording mediums may be usable.

With the above structure, the user can record a broadcast program that the reception device 8300 receives with any of the reception methods described in the above embodiments, and time-shift viewing of the recorded broadcast program is possible anytime after the broadcast.

In the above description of the reception device 8300, the recording unit 8308 records multiplexed data obtained as a result of demodulation and error correction by the demodulation unit 8302. However, the recording unit 8308 may record part of data extracted from the data contained in the multiplexed data. For example, the multiplexed data obtained as a result of demodulation and error correction by the demodulation unit 8302 may contain contents of data broadcast service, in addition to video data and audio data. In this case, new multiplexed data may be generated by multiplexing the video data and audio data, without the contents of broadcast service, extracted from the multiplexed data demodulated by the demodulation unit 8302, and the recording unit 8308 may record the newly generated multiplexed data. Alternatively, new multiplexed data may be generated by multiplexing either of the video data and audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302, and the recording unit 8308 may record the newly generated multiplexed data. The recording unit 8308 may also record the contents of data broadcast service included, as described above, in the multiplexed data.

The reception device 8300 described in this embodiment may be included in a television, a recorder (such as DVD recorder, Blu-ray recorder, HDD recorder, SD card recorder, or the like), or a mobile telephone. In such a case, the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 may contain data for correcting errors (bugs) in software used to operate the television or recorder or in software used to prevent disclosure of personal or confidential information. If such data is contained, the data is installed on the television or recorder to correct the software errors. Further, if data for correcting errors (bugs) in software installed in the reception device 8300 is contained, such data is used to correct errors that the reception device 8300 may have. This arrangement ensures more stable operation of the TV, recorder, or mobile phone in which the reception device 8300 is implemented.

Note that it may be the stream input/output unit 8303 that handles extraction of data from the whole data contained in multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 and multiplexing of the extracted data. More specifically, under instructions given from a control unit not illustrated in the figures, such as a CPU, the stream input/output unit 8303 demultiplexes video data, audio data, contents of data broadcast service etc. from the multiplexed data demodulated by the demodulation unit 8302, extracts specific pieces of data from the demultiplexed data, and multiplexes the extracted data pieces to generate new multiplexed data. The data pieces to be extracted from demultiplexed data may be determined by the user or determined in advance for the respective types of recording mediums.

With the above structure, the reception device 8300 is enabled to extract and record only data necessary to view a recorded broadcast program, which is effective to reduce the size of data to be recorded.

In the above description, the recording unit 8308 records multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Alternatively, however, the recording unit 8308 may record new multiplexed data generated by multiplexing video data newly yielded by encoding the original video data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Here, the moving picture coding method to be employed may be different from that used to encode the original video data, so that the data size or bit rate of the new video data is smaller than the original video data. Here, the moving picture coding method used to generate new video data may be of a different standard from that used to generate the original video data. Alternatively, the same moving picture coding method may be used but with different parameters. Similarly, the recording unit 8308 may record new multiplexed data generated by multiplexing audio data newly obtained by encoding the original audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Here, the audio coding method to be employed may be different from that used to encode the original audio data, such that the data size or bit rate of the new audio data is smaller than the original audio data.

The process of converting the original video or audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 into the video or audio data of a different data size or bit rate is performed, for example, by the stream input/output unit 8303 and the signal processing unit 8304. More specifically, under instructions given from the control unit such as the CPU, the stream input/output unit 8303 demultiplexes video data, audio data, contents of data broadcast service etc. from the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Under instructions given from the control unit, the signal processing unit 8304 converts the demultiplexed video data and audio data respectively using a motion picture coding method and an audio coding method each different from the method that was used in the conversion applied to obtain the video and audio data. Under instructions given from the control unit, the stream input/output unit 8303 multiplexes the newly converted video data and audio data to generate new multiplexed data. Note that the signal processing unit 8304 may conduct the conversion of either or both of the video or audio data according to instructions given from the control unit. In addition, the sizes of video data and audio data to be obtained by encoding may be specified by a user or determined in advance for the types of recording mediums.

With the above arrangement, the reception device 8300 is enabled to record video and audio data after converting the data to a size recordable on the recording medium or to a size or bit rate that matches the read or write rate of the recording unit 8308. This arrangement enables the recoding unit to duly record a program, even if the size recordable on the recording medium is smaller than the data size of the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302, or if the rate at which the recording unit records or reads is lower than the bit rate of the multiplexed data. Consequently, time-shift viewing of the recorded program by the user is possible anytime after the broadcast.

Furthermore, the reception device 8300 additionally includes a stream output interface (IF) 8309 for transmitting multiplexed data demodulated by the demodulation unit 8302 to an external device via a transport medium 8330. In one example, the stream output IF 8309 may be a radio communication device that transmits multiplexed data via a wireless medium (equivalent to the transport medium 8330) to an external device by modulating the multiplexed data with in accordance with a wireless communication method compliant with a wireless communication standard such as Wi-Fi (registered trademark, a set of standards including IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, and IEEE 802.11n), WiGiG, Wireless HD, Bluetooth, ZigBee, or the like. The stream output IF 8309 may also be a wired communication device that transmits multiplexed data via a transmission line (equivalent to the transport medium 8330) physically connected to the stream output IF 8309 to an external device, modulating the multiplexed data using a communication method compliant with wired communication standards, such as Ethernet (registered trademark), Universal Serial Bus (USB), Power Line Communication (PLC), or High-Definition Multimedia Interface (HDMI).

With the above structure, the user can use, on an external device, multiplexed data received by the reception device 8300 using the reception method described according to the above embodiments. The usage of multiplexed data by the user mentioned herein includes use of the multiplexed data for real-time viewing on an external device, recording of the multiplexed data by a recording unit included in an external device, and transmission of the multiplexed data from an external device to a yet another external device.

In the above description of the reception device 8300, the stream output IF 8309 outputs multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. However, the reception device 8300 may output data extracted from data contained in the multiplexed data, rather than the whole data contained in the multiplexed data. For example, the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 may contain contents of data broadcast service, in addition to video data and audio data. In this case, the stream output IF 8309 may output multiplexed data newly generated by multiplexing video and audio data extracted from the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. In another example, the stream output IF 8309 may output multiplexed data newly generated by multiplexing either of the video data and audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302.

Note that it may be the stream input/output unit 8303 that handles extraction of data from the whole data contained in multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 and multiplexing of the extracted data. More specifically, under instructions given from a control unit not illustrated in the figures, such as a Central Processing Unit (CPU), the stream input/output unit 8303 demultiplexes video data, audio data, contents of data broadcast service etc. from the multiplexed data demodulated by the demodulation unit 8302, extracts specific pieces of data from the demultiplexed data, and multiplexes the extracted data pieces to generate new multiplexed data. The data pieces to be extracted from demultiplexed data may be determined by the user or determined in advance for the respective types of the stream output IF 8309.

With the above structure, the reception device 8300 is enabled to extract and output only data necessary for an external device, which is effective to reduce the bandwidth used to output the multiplexed data.

In the above description, the stream output IF 8309 outputs multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Alternatively, however, the stream output IF 8309 may output new multiplexed data generated by multiplexing video data newly yielded by encoding the original video data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. The new video data is encoded with a moving picture coding method different from that used to encode the original video data, so that the data size or bit rate of the new video data is smaller than the original video data. Here, the moving picture coding method used to generate new video data may be of a different standard from that used to generate the original video data. Alternatively, the same moving picture coding method may be used but with different parameters. Similarly, the stream output IF 8309 may output new multiplexed data generated by multiplexing audio data newly obtained by encoding the original audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. The new audio data is encoded with an audio coding method different from that used to encode the original audio data, such that the data size or bit rate of the new audio data is smaller than the original audio data.

The process of converting the original video or audio data contained in the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 into the video or audio data of a different data size of bit rate is performed, for example, by the stream input/output unit 8303 and the signal processing unit 8304. More specifically, under instructions given from the control unit, the stream input/output unit 8303 demultiplexes video data, audio data, contents of data broadcast service etc. from the multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. Under instructions given from the control unit, the signal processing unit 8304 converts the demultiplexed video data and audio data respectively using a motion picture coding method and an audio coding method each different from the method that was used in the conversion applied to obtain the video and audio data. Under instructions given from the control unit, the stream input/output unit 8303 multiplexes the newly converted video data and audio data to generate new multiplexed data. Note that the signal processing unit 8304 may perform the conversion of either or both of the video or audio data according to instructions given from the control unit. In addition, the sizes of video data and audio data to be obtained by conversion may be specified by the user or determined in advance for the types of the stream output IF 8309.

With the above structure, the reception device 8300 is enabled to output video and audio data after converting the data to a bit rate that matches the transfer rate between the reception device 8300 and an external device. This arrangement ensures that even if multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302 is higher in bit rate than the data transfer rate to an external device, the stream output IF duly outputs new multiplexed data at an appropriate bit rate to the external device. Consequently, the user can use the new multiplexed data on another communication device.

Furthermore, the reception device 8300 also includes an audio and visual output interface (hereinafter, AV output IF) 8311 that outputs video and audio signals decoded by the signal processing unit 8304 to an external device via an external transport medium. In one example, the AV output IF 8311 may be a wireless communication device that transmits modulated video and audio signals via a wireless medium to an external device, using a wireless communication method compliant with wireless communication standards, such as Wi-Fi (registered trademark), which is a set of standards including IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, and IEEE 802.11n, WiGiG, Wireless HD, Bluetooth, ZigBee, or the like. In another example, the stream output IF 8309 may be a wired communication device that transmits modulated video and audio signals via a transmission line physically connected to the stream output IF 8309 to an external device, using a communication method compliant with wired communication standards, such as Ethernet (registered trademark), USB, PLC, HDMI, or the like. In yet another example, the stream output IF 8309 may be a terminal for connecting a cable to output the video and audio signals in analog form.

With the above structure, the user is allowed to use, on an external device, the video and audio signals decoded by the signal processing unit 8304.

Furthermore, the reception device 8300 additionally includes an operation input unit 8310 for receiving a user operation. According to control signals indicative of user operations input to the operation input unit 8310, the reception device 8300 performs various operations, such as switching the power ON or OFF, switching the reception channel, switching the display of subtitle text ON or OFF, switching the display of subtitle text to another language, changing the volume of audio output of the audio output unit 8306, and changing the settings of channels that can be received.

Additionally, the reception device 8300 may have a function of displaying the antenna level indicating the quality of the signal being received by the reception device 8300. Note that the antenna level is an indicator of the reception quality calculated based on, for example, the Received Signal Strength Indication, Received Signal Strength Indicator (RSSI), received field strength, Carrier-to-noise power ratio (C/N), Bit Error Rate (BER), packet error rate, frame error rate, and channel state information of the signal received on the reception device 8300. In other words, the antenna level is a signal indicating the level and quality of the received signal. In this case, the demodulation unit 8302 also includes a reception quality measuring unit for measuring the received signal characteristics, such as RSSI, received field strength, C/N, BER, packet error rate, frame error rate, and channel state information. In response to a user operation, the reception device 8300 displays the antenna level (i.e., signal indicating the level and quality of the received signal) on the video display unit 8307 in a manner identifiable by the user. The antenna level (i.e., signal indicating the level and quality of the received signal) may be numerically displayed using a number that represents RSSI, received field strength, C/N, BER, packet error rate, frame error rate, channel state information or the like. Alternatively, the antenna level may be displayed using an image representing RSSI, received field strength, C/N, BER, packet error rate, frame error rate, channel state information or the like. Furthermore, the reception device 8300 may display a plurality of antenna levels (signals indicating the level and quality of the received signal) calculated for each of the plurality of streams s1, s2, . . . received and separated using the reception methods shown in the above embodiments, or one antenna level (signal indicating the level and quality of the received signal) calculated from the plurality of streams s1, s2, . . . . When video data and audio data composing a program are transmitted hierarchically, the reception device 8300 may also display the signal level (signal indicating the level and quality of the received signal) for each hierarchical level.

With the above structure, users are able to grasp the antenna level (signal indicating the level and quality of the received signal) numerically or visually during reception with the reception methods shown in the above embodiments.

Although the reception device 8300 is described above as having the audio output unit 8306, video display unit 8307, recording unit 8308, stream output IF 8309, and AV output IF 8311, it is not necessary for the reception device 8300 to have all of these units. As long as the reception device 8300 is provided with at least one of the units described above, the user is enabled to use multiplexed data obtained as a result of demodulation and error correction decoding by the demodulation unit 8302. The reception device 8300 may therefore include any combination of the above-described units depending on its intended use.

Multiplexed Data

The following is a detailed description of an exemplary structure of multiplexed data. The data structure typically used in broadcasting is an MPEG2 transport stream (TS), so therefore the following description is given by way of an example related to MPEG2-TS. It should be naturally appreciated, however, that the data structure of multiplexed data transmitted by the transmission and reception methods described in the above embodiments is not limited to MPEG2-TS and the advantageous effects of the above embodiments are achieved even if any other data structure is employed.

FIG. 84 is a view illustrating an exemplary multiplexed data structure. As illustrated in FIG. 84, multiplexed data is obtained by multiplexing one or more elementary streams, which are elements constituting a broadcast program (program or an event which is part of a program) currently provided through respective services. Examples of elementary streams include a video stream, audio stream, presentation graphics (PG) stream, and interactive graphics (IG) stream. In the case where a broadcast program carried by multiplexed data is a movie, the video streams represent main video and sub video of the movie, the audio streams represent main audio of the movie and sub audio to be mixed with the main audio, and the PG stream represents subtitles of the movie. The term “main video” used herein refers to video images normally presented on a screen, whereas “sub video” refers to video images (for example, images of text explaining the outline of the movie) to be presented in a small window inserted within the video images. The IG stream represents an interactive display constituted by presenting GUI components on a screen.

Each stream contained in multiplexed data is identified by an identifier called PID uniquely assigned to the stream. For example, the video stream carrying main video images of a movie is assigned with “0x1011”, each audio stream is assigned with a different one of “0x1100” to “0x111F”, each PG stream is assigned with a different one of “0x1200” to “0x121F”, each IG stream is assigned with a different one of “0x1400” to “0x141F”, each video stream carrying sub video images of the movie is assigned with a different one of “0x1B00” to “0x1B1F”, each audio stream of sub-audio to be mixed with the main audio is assigned with a different one of “0x1A00” to “0x1A1F”.

FIG. 85 is a schematic view illustrating an example of how the respective streams are multiplexed into multiplexed data. First, a video stream 8501 composed of a plurality of video frames is converted into a PES packet sequence 8502 and then into a TS packet sequence 8503, whereas an audio stream 8504 composed of a plurality of audio frames is converted into a PES packet sequence 8505 and then into a TS packet sequence 8506. Similarly, the PG stream 8511 is first converted into a PES packet sequence 8512 and then into a TS packet sequence 8513, whereas the IG stream 8514 is converted into a PES packet sequence 8515 and then into a TS packet sequence 8516. The multiplexed data 8517 is obtained by multiplexing the TS packet sequences (8503, 8506, 8513 and 8516) into one stream.

FIG. 86 illustrates the details of how a video stream is divided into a sequence of PES packets. In FIG. 86, the first tier shows a sequence of video frames included in a video stream. The second tier shows a sequence of PES packets. As indicated by arrows yy1, yy2, yy3, and yy4 shown in FIG. 86, a plurality of video presentation units, namely I pictures, B pictures, and P pictures, of a video stream are separately stored into the payloads of PES packets on a picture-by-picture basis. Each PES packet has a PES header and the PES header stores a Presentation Time-Stamp (PTS) and Decoding Time-Stamp (DTS) indicating the display time and decoding time of a corresponding picture.

FIG. 87 illustrates the format of a TS packet to be eventually written as multiplexed data. The TS packet is a fixed length packet of 188 bytes and has a 4-byte TS header containing such information as PID identifying the stream and a 184-byte TS payload carrying actual data. The PES packets described above are divided to be stored into the TS payloads of TS packets. In the case of BD-ROM, each TS packet is attached with a TP_Extra_Header of 4 bytes to build a 192-byte source packet, which is to be written as multiplexed data. The TP_Extra_Header contains such information as an Arrival_Time_Stamp (ATS). The ATS indicates a time for starring transfer of the TS packet to the PID filter of a decoder. As shown on the lowest tier in FIG. 87, multiplexed data includes a sequence of source packets each bearing a source packet number (SPN), which is a number incrementing sequentially from the start of the multiplexed data.

In addition to the TS packets storing streams such as video, audio, and PG streams, multiplexed data also includes TS packets storing a Program Association Table (PAT), a Program Map Table (PMT), and a Program Clock Reference (PCR). The PAT in multiplexed data indicates the PID of a PMT used in the multiplexed data, and the PID of the PAT is “0”. The PMT includes PIDs identifying the respective streams, such as video, audio and subtitles, contained in multiplexed data and attribute information (frame rate, aspect ratio, and the like) of the streams identified by the respective PIDs. In addition, the PMT includes various types of descriptors relating to the multiplexed data. One of such descriptors may be copy control information indicating whether or not copying of the multiplexed data is permitted. The PCR includes information for synchronizing the Arrival Time Clock (ATC), which is the time axis of ATS, with the System Time Clock (STC), which is the time axis of PTS and DTS. More specifically, the PCR packet includes information indicating an STC time corresponding to the ATS at which the PCR packet is to be transferred.

FIG. 88 is a view illustrating the data structure of the PMT in detail. The PMT starts with a PMT header indicating the length of data contained in the PMT. Following the PMT header, descriptors relating to the multiplexed data are disposed. One example of a descriptor included in the PMT is copy control information described above. Following the descriptors, pieces of stream information relating to the respective streams included in the multiplexed data are arranged. Each piece of stream information is composed of stream descriptors indicating a stream type identifying a compression codec employed for a corresponding stream, a PID of the stream, and attribute information (frame rate, aspect ratio, and the like) of the stream. The PMT includes as many stream descriptors as the number of streams included in the multiplexed data.

When recorded onto a recoding medium, for example, the multiplexed data is recorded along with a multiplexed data information file.

FIG. 89 is a view illustrating the structure of the multiplexed data information file. As illustrated in FIG. 89, the multiplexed data information file is management information of corresponding multiplexed data and is composed of multiplexed data information, stream attribute information, and an entry map. Note that multiplexed data information files and multiplexed data are in a one-to-one relationship.

As illustrated in FIG. 89, the multiplexed data information is composed of a system rate, playback start time, and playback end time. The system rate indicates the maximum transfer rate of the multiplexed data to the PID filter of a system target decoder, which is described later. The multiplexed data includes ATSs at intervals set so as not to exceed the system rate. The playback start time is set to the time specified by the PTS of the first video frame in the multiplexed data, whereas the playback end time is set to the time calculated by adding the playback period of one frame to the PTS of the termination video frame in the multiplexed data.

FIG. 90 illustrates the structure of stream attribute information contained in multiplexed data information file. As illustrated in FIG. 90, the stream attribute information includes pieces of attribute information of the respective streams included in multiplexed data, and each piece of attribute information is registered with a corresponding PID. That is, different pieces of attribute information are provided for different streams, namely a video stream, an audio stream, a PG stream and an IG stream. The video stream attribute information indicates the compression codec employed to compress the video stream, the resolutions of individual pictures constituting the video stream, the aspect ratio, the frame rate, and so on. The audio stream attribute information indicates the compression codec employed to compress the audio stream, the number of channels included in the audio stream, the language of the audio stream, the sampling frequency, and so on. These pieces of information are used to initialize a decoder before playback by a player.

In the present embodiment, from among the pieces of information included in the multiplexed data, the stream type included in the PMT is used. In the case where the multiplexed data is recorded on a recording medium, the video stream attribute information included in the multiplexed data information file is used. More specifically, the moving picture coding method and device described in any of the above embodiments may be modified to additionally include a step or unit of setting a specific piece of information in the stream type included in the PMT or in the video stream attribute information. The specific piece of information is for indicating that the video data is generated by the moving picture coding method and device described in the embodiment. With the above structure, video data generated by the moving picture coding method and device described in any of the above embodiments is distinguishable from video data compliant with other standards.

FIG. 91 illustrates an exemplary structure of a video and audio output device 9100 that includes a reception device 9104 for receiving a modulated signal carrying video and audio data or data for data broadcasting from a broadcasting station (base station). Note that the structure of the reception device 9104 corresponds to the reception device 8300 illustrated in FIG. 83. The video and audio output device 9100 is installed with an Operating System (OS), for example, and also with a transmission device 9106 (a device for a wireless Local Area Network (LAN) or Ethernet, for example) for establishing an Internet connection. With this structure, hypertext (World Wide Web (WWW)) 9103 provided over the Internet can be displayed on a display area 9101 simultaneously with images 9102 reproduced on the display area 9101 from the video and audio data or data provided by data broadcasting. By operating a remote control (which may be a mobile phone or keyboard) 9107, the user can make a selection on the images 9102 reproduced from data provided by data broadcasting or the hypertext 9103 provided over the Internet to change the operation of the video and audio output device 9100. For example, by operating the remote control to make a selection on the hypertext 9103 provided over the Internet, the user can change the WWW site currently displayed to another site. Alternatively, by operating the remote control 9107 to make a selection on the images 9102 reproduced from the video or audio data or data provided by the data broadcasting, the user can transmit information indicating a selected channel (such as a selected broadcast program or audio broadcasting). In response, an interface (IF) 9105 acquires information transmitted from the remote control, so that the reception device 9104 operates to obtain reception data by demodulation and error correction of a signal carried on the selected channel. At this time, the reception device 9104 receives control symbols included in a signal corresponding to the selected channel and containing information indicating the transmission method of the signal (exactly as shown in FIGS. 5 and 41). With this information, the reception device 9104 is enabled to make appropriate settings for the receiving operations, demodulation method, method of error correction decoding, and the like to duly receive data included in data symbols transmitted from a broadcasting station (base station). Although the above description is directed to an example in which the user selects a channel using the remote control 9107, the same description applies to an example in which the user selects a channel using a selection key provided on the video and audio output device 9100.

In addition, the video and audio output device 9100 may be operated via the Internet. For example, a terminal connected to the Internet may be used to make settings on the video and audio output device 9100 for pre-programmed recording (storing). (The video and audio output device 9100 therefore would have the recording unit 8308 as illustrated in FIG. 83.) In this case, before starting the pre-programmed recording, the video and audio output device 9100 selects the channel, so that the receiving device 9104 operates to obtain reception data by demodulation and error correction decoding of a signal carried on the selected channel. At this time, the reception device 9104 receives control symbols included in a signal corresponding to the selected channel and containing information indicating the transmission method (the transmission method, modulation method, error correction method, and the like in the above embodiments) of the signal (exactly as shown in FIGS. 5 and 41). With this information, the reception device 9104 is enabled to make appropriate settings for the receiving operations, demodulation method, method of error correction decoding, and the like to duly receive data included in data symbols transmitted from a broadcasting station (base station).

Supplementary Explanation

In the present description, it is considered that a communications/broadcasting device such as a broadcast station, a base station, an access point, a terminal, a mobile phone, or the like is provided with the transmission device, and that a communications device such as a television, radio, terminal, personal computer, mobile phone, access point, base station, or the like is provided with the reception device. Additionally, it is considered that the transmission device and the reception device in the present description have a communications function and are capable of being connected via some sort of interface (such as a USB) to a device for executing applications for a television, radio, personal computer, mobile phone, or the like.

Furthermore, in the present embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, postamble, reference symbol, and the like), symbols for control information, and the like may be arranged in the frame in any way. While the terms “pilot symbol” and “symbols for control information” have been used here, any term may be used, since the function itself is what is important.

It suffices for a pilot symbol, for example, to be a known symbol modulated with PSK modulation in the transmission and reception devices (or for the reception device to be able to synchronize in order to know the symbol transmitted by the transmission device). The reception device uses this symbol for synchronization of frequency, synchronization of time, channel estimation (estimation of Channel State Information (CSI) for each modulated signal), detection of signals, and the like.

A symbol for control information is for transmitting information other than data (of applications or the like) that needs to be transmitted to the communication partner for achieving communication (for example, the modulation method, error correction coding method, coding rate of the error correction coding method, setting information in the upper layer, and the like).

Note that the present invention is not limited to the above embodiments and may be embodied with a variety of modifications. For example, the above embodiments describe communications devices, but the present invention is not limited to these devices and may be implemented as software for the corresponding communications method.

Furthermore, a precoding hopping method used in a method of transmitting two modulated signals from two antennas has been described, but the present invention is not limited in this way. The present invention may be also embodied as a precoding hopping method for similarly changing precoding weights (matrices) in the context of a method whereby four mapped signals are precoded to generate four modulated signals that are transmitted from four antennas, or more generally, whereby N mapped signals are precoded to generate N modulated signals that are transmitted from N antennas.

In the present description, the terms “precoding”, “precoding matrix”, “precoding weight matrix” and the like are used, but any term may be used (such as “codebook”, for example) since the signal processing itself is what is important in the present invention.

Furthermore, in the present description, the reception device has been described as using ML calculation, APP, Max-log APP, ZF, MMSE, or the like, which yields soft decision results (log-likelihood, log-likelihood ratio) or hard decision results (“0” or “1”) for each bit of data transmitted by the transmission device. This process may be referred to as detection, demodulation, estimation, or separation.

Different data may be transmitted in streams s1(t) and s2(t), or the same data may be transmitted.

Assume that precoded baseband signals z1(i), z2(i) (where i represents the order in terms of time or frequency (carrier)) are generated by precoding baseband signals s1(i) and s2(i) for two streams while regularly hopping between precoding matrices. Let the in-phase component I and the quadrature-phase component Q of the precoded baseband signal z1(i) be I₁(i) and Q₁(i) respectively, and let the in-phase component I and the quadrature-phase component Q of the precoded baseband signal z2(i) be I₂(i) and Q₂(i) respectively. In this case, the baseband components may be switched, and modulated signals corresponding to the switched baseband signal r1(i) and the switched baseband signal r2(i) may be transmitted from different antennas at the same time and over the same frequency by transmitting a modulated signal corresponding to the switched baseband signal r1(i) from transmit antenna 1 and a modulated signal corresponding to the switched baseband signal r2(i) from transmit antenna 2 at the same time and over the same frequency. Baseband components may be switched as follows.

-   -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₁(i) and Q₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be I₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₁(i) and I₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₁(i) and Q₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₁(i) and Q₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₁(i) and I₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be I₁(i) and Q₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₁(i) and I₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be Q₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be I₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r1(i) be Q₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r2(i)         be Q₁(i) and I₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₁(i) and I₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be Q₁(i) and Q₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be Q₁(i) and Q₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₁(i) and I₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1         (i) be Q₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1         (i) be Q₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₁(i) and Q₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be I₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be I₁(i) and Q₂(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be Q₁(i) and I₂(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be Q₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be I₂(i) and Q₁(i) respectively.     -   Let the in-phase component and the quadrature-phase component of         the switched baseband signal r2(i) be Q₂(i) and I₁(i)         respectively, and the in-phase component and the         quadrature-phase component of the switched baseband signal r1(i)         be Q₁(i) and I₂(i) respectively.

In the above description, signals in two streams are precoded, and in-phase components and quadrature-phase components of the precoded signals are switched, but the present invention is not limited in this way. Signals in more than two streams may be precoded, and the in-phase components and quadrature-phase components of the precoded signals may be switched.

Each of the transmit antennas of the transmission device and the receive antennas of the reception device shown in the figures may be formed by a plurality of antennas.

In this description, the symbol “∀” represents the universal quantifier, and the symbol “∃” represents the existential quantifier.

Furthermore, in this description, the units of phase, such as argument, in the complex plane are radians.

When using the complex plane, complex numbers may be shown in polar form by polar coordinates. If a complex number z=a+jb (where a and b are real numbers and j is an imaginary unit) corresponds to a point (a, b) on the complex plane, and this point is represented in polar coordinates as [r, θ], then the following equations hold. a=r×cos θ b=r×sin θ Math 303

$r = \sqrt{a^{2} + b^{2}}$

r is the absolute value of z (r=|z|), and θ is the argument. Furthermore, z=a+jb is represented as re^(jθ).

In the description of the present invention, the baseband signal, modulated signal s1, modulated signal s2, modulated signal z1, and modulated signal z2 are complex signals. Complex signals are represented as I+jQ (where j is an imaginary unit), I being the in-phase signal, and Q being the quadrature-phase signal. In this case, I may be zero, or Q may be zero.

The method of allocating different precoding matrices to frames (in the time domain and/or the frequency domain) described in this description (for example, Embodiment 1 and Embodiments 17 through 20) may be implemented using other precoding matrices than the different precoding matrices in this description. The method of regularly hopping between precoding matrices may also coexist with or be switched with other transmission methods. In this case as well, the method of regularly hopping between different precoding matrices described in this description may be implemented using different precoding matrices.

FIG. 59 shows an example of a broadcasting system that uses the method of regularly hopping between precoding matrices described in this description. In FIG. 59, a video encoder 5901 receives video images as input, encodes the video images, and outputs encoded video images as data 5902. An audio encoder 5903 receives audio as input, encodes the audio, and outputs encoded audio as data 5904. A data encoder 5905 receives data as input, encodes the data (for example by data compression), and outputs encoded data as data 5906. Together, these encoders are referred to as information source encoders 5900.

A transmission unit 5907 receives, as input, the data 5902 of the encoded video, the data 5904 of the encoded audio, and the data 5906 of the encoded data, sets some or all of these pieces of data as transmission data, and outputs transmission signals 5908_1 through 5908_N after performing processing such as error correction encoding, modulation, and precoding (for example, the signal processing of the transmission device in FIG. 3). The transmission signals 5908_1 through 5908_N are transmitted by antennas 5909_1 through 5909_N as radio waves.

A reception unit 5912 receives, as input, received signals 5911_1 through 5911_M received by antennas 5910_1 through 5910_M, performs processing such as frequency conversion, decoding of precoding, log-likelihood ratio calculation, and error correction decoding (processing by the reception device in FIG. 7, for example), and outputs received data 5913, 5915, and 5917. Information source decoders 5919 receive, as input, the received data 5913, 5915, and 5917. A video decoder 5914 receives, as input, the received data 5913, performs video decoding, and outputs a video signal. Video images are then shown on a television or display monitor. Furthermore, an audio decoder 5916 receives, as input, the received data 5915, performs audio decoding, and outputs an audio signal. Audio is then produced by a speaker. A data encoder 5918 receives, as input, the received data 5917, performs data decoding, and outputs information in the data.

In the above embodiments describing the present invention, the number of encoders in the transmission device when using a multi-carrier transmission method such as OFDM may be any number, as described above. Therefore, as in FIG. 4, for example, it is of course possible for the transmission device to have one encoder and to adapt a method of distributing output to a multi-carrier transmission method such as OFDM. In this case, the wireless units 310A and 310B in FIG. 4 are replaced by the OFDM related processors 1301A and 1301B in FIG. 13. The description of the OFDM related processors is as per Embodiment 1.

While this description refers to a “method of hopping between different precoding matrices”, the specific “method of hopping between different precoding matrices” illustrated in this description is only an example. All of the embodiments in this description may be similarly implemented by replacing the “method of hopping between different precoding matrices” with a “method of regularly hopping between precoding matrices using a plurality of different precoding matrices”.

Programs for executing the above transmission method may, for example, be stored in advance in Read Only Memory (ROM) and be caused to operate by a Central Processing Unit (CPU).

Furthermore, the programs for executing the above transmission method may be stored in a computer-readable recording medium, the programs stored in the recording medium may be loaded in the Random Access Memory (RAM) of the computer, and the computer may be caused to operate in accordance with the programs.

The components in the above embodiments may be typically assembled as a Large Scale Integration (LSI), a type of integrated circuit. Individual components may respectively be made into discrete chips, or part or all of the components in each embodiment may be made into one chip. While an LSI has been referred to, the terms Integrated Circuit (IC), system LSI, super LSI, or ultra LSI may be used depending on the degree of integration. Furthermore, the method for assembling integrated circuits is not limited to LSI, and a dedicated circuit or a general-purpose processor may be used. A Field Programmable Gate Array (FPGA), which is programmable after the LSI is manufactured, or a reconfigurable processor, which allows reconfiguration of the connections and settings of circuit cells inside the LSI, may be used.

Furthermore, if technology for forming integrated circuits that replaces LSIs emerges, owing to advances in semiconductor technology or to another derivative technology, the integration of functional blocks may naturally be accomplished using such technology. The application of biotechnology or the like is possible.

A precoding method according to an embodiment of the present invention is for generating a first and a second transmission signal by using one of a plurality of precoding matrices to precode a first and a second modulated signal, the first and the second modulated signal being modulated in accordance with a modulation method and composed of an in-phase component and a quadrature-phase component, the precoding method comprising the steps of: regularly switching the precoding matrix used to generate the first and the second transmission signal to another one of the precoding matrices; and generating the first and the second transmission signal, wherein for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which the second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, two fourth symbols adjacent to the first symbol in the time domain are both data symbols, five symbols are precoded with different precoding matrices in order to generate the first transmission signal, the five symbols being the first symbol, the two third symbols, and the two fourth symbols, and the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain are precoded with the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols in order to generate the second transmission signal.

A signal processing device implementing a precoding method according to an embodiment of the present invention is for generating a first and a second transmission signal by using one of a plurality of precoding matrices to precode a first and a second modulated signal, the first and the second modulated signal being modulated in accordance with a modulation method and composed of an in-phase component and a quadrature-phase component, wherein the signal processing device regularly switches the precoding matrix used to generate the first and the second transmission signal to another one of the precoding matrices, and generates the first and the second transmission signal, wherein for a first symbol that is a data symbol used to transmit data of the first modulated signal and a second symbol that is a data symbol used to transmit data of the second modulated signal, a first time and a first frequency at which the first symbol is to be precoded and transmitted match a second time and a second frequency at which the second symbol is to be precoded and transmitted, two third symbols adjacent to the first symbol in the frequency domain are both data symbols, two fourth symbols adjacent to the first symbol in the time domain are both data symbols, five symbols are precoded with different precoding matrices in order to generate the first transmission signal, the five symbols being the first symbol, the two third symbols, and the two fourth symbols, and the second symbol, two fifth symbols adjacent to the second symbol in the frequency domain, and two sixth symbols adjacent to the second symbol in the time domain are precoded with the same precoding matrix used to precode a symbol at a matching time and frequency among the first symbol, the two third symbols, and the two fourth symbols in order to generate the second transmission signal.

INDUSTRIAL APPLICABILITY

The present invention is widely applicable to wireless systems that transmit different modulated signals from a plurality of antennas, such as an OFDM-MIMO system. Furthermore, in a wired communication system with a plurality of transmission locations (such as a Power Line Communication (PLC) system, optical communication system, or Digital Subscriber Line (DSL) system), the present invention may be adapted to MIMO, in which case a plurality of transmission locations are used to transmit a plurality of modulated signals as described by the present invention. A modulated signal may also be transmitted from a plurality of transmission locations.

REFERENCE SIGNS LIST

-   -   302A, 302B Encoder     -   304A, 304B Interleaver     -   306A, 306B Mapper     -   314 Weighting information generating unit     -   308A, 308B Weighting unit     -   310A, 310B Wireless unit     -   312A, 312B Antenna     -   402 Encoder     -   404 Distribution unit     -   504#1, 504#2 Transmit antenna     -   505#1,505#2 Receive antenna     -   600 Weighting unit     -   703_X Wireless unit     -   701_X Antenna     -   705_1 Channel fluctuation estimating unit     -   705_2 Channel fluctuation estimating unit     -   707_1 Channel fluctuation estimating unit     -   707_2 Channel fluctuation estimating unit     -   709 Control information decoding unit     -   711 Signal processing unit     -   803 INNER MIMO detector     -   805A, 805B Log-likelihood calculating unit     -   807A, 807B Deinterleaver     -   809A, 809B Log-likelihood ratio calculating unit     -   811A, 811B Soft-in/soft-out decoder     -   813A, 813B Interleaver     -   815 Storage unit     -   819 Weighting coefficient generating unit     -   901 Soft-in/soft-out decoder     -   903 Distribution unit     -   1301A, 1301B OFDM related processor     -   1402A, 1402A Serial/parallel converter     -   1404A, 1404B Reordering unit     -   1406A, 1406B Inverse fast Fourier transformer     -   1408A, 1408B Wireless unit     -   2200 Precoding weight generating unit     -   2300 Reordering unit     -   4002 Encoder group 

The invention claimed is:
 1. A transmission method comprising: inserting a plurality of pilot symbols into each of a first modulated symbol sequence and a second modulated symbol sequence in accordance with a determined timing, the first modulated symbol sequence and the second modulated symbol sequence each including a video signal or an audio signal, the video signal being to be displayed on a monitor of a reception device, and the audio signal being to be output from a speaker of the reception device; performing phase shift on the first modulated symbol sequence and the second modulated symbol sequence, each into which the plurality of pilot symbols are inserted, using a phase shift coefficient that is regularly switched between a plurality of phase shift coefficients to generate a first phase-shifted symbol sequence and a second phase-shifted symbol sequence, respectively; generating a first Orthogonal Frequency-Division Multiplexing (OFDM) signal and a second OFDM signal using the first phase-shifted symbol sequence and the second phase-shifted symbol sequence, respectively; and transmitting the first OFDM signal from a first transmission branch at a first frequency and at a first time, and transmitting the second OFDM signal from a second transmission branch at the first frequency and at the first time, wherein the plurality of phase shift coefficients include a first phase amount that regularly varies, the first OFDM signal includes a first subcarrier signal, a second subcarrier signal, and a third subcarrier signal that are consecutive in a frequency domain, the second OFDM signal includes a fourth subcarrier signal, a fifth subcarrier signal, and a sixth subcarrier signal that are consecutive in the frequency domain, the second subcarrier signal and the fifth subcarrier signal include the plurality of pilot symbols arranged at the same frequency, and a difference in terms of phase amount included in a phase shift coefficient between a first symbol arranged in the first subcarrier signal and a second symbol arranged in the third subcarrier signal is twice the first phase amount.
 2. A transmission device comprising: signal generation circuitry which, in operation, inserts a plurality of pilot symbols into each of a first modulated symbol sequence and a second modulated symbol sequence in accordance with a determined timing, the first modulated symbol sequence and the second modulated symbol sequence each including a video signal or an audio signal, the video signal being to be displayed on a monitor of a reception device, and the audio signal being to be output from a speaker of the reception device; phase shift circuitry which, in operation, performs phase shift on the first modulated symbol sequence and the second modulated symbol sequence, each into which the plurality of pilot symbols are inserted, using a phase shift coefficient that is regularly switched between a plurality of phase shift coefficients to generate a first phase-shifted symbol sequence and a second phase-shifted symbol sequence, respectively; Orthogonal Frequency-Division Multiplexing (OFDM) signal generation circuitry which, in operation, generates a first OFDM signal and a second OFDM signal using the first phase-shifted symbol sequence and the second phase-shifted symbol sequence, respectively; and transmission circuitry which, in operation, transmits the first OFDM signal from a first transmission branch at a first frequency and at a first time, and transmits the second OFDM signal from a second transmission branch at the first frequency and at the first time, wherein the plurality of phase shift coefficients include a first phase amount that regularly varies, the first OFDM signal includes a first subcarrier signal, a second subcarrier signal, and a third subcarrier signal that are consecutive in a frequency domain, the second OFDM signal includes a fourth subcarrier signal, a fifth subcarrier signal, and a sixth subcarrier signal that are consecutive in the frequency domain, the second subcarrier signal and the fifth subcarrier signal include the plurality of pilot symbols arranged at the same frequency, and a difference in terms of phase amount included in a phase shift coefficient between a first symbol arranged in the first subcarrier signal and a second symbol arranged in the third subcarrier signal is twice the first phase amount.
 3. A reception method comprising: demultiplexing a multiplexed signal including a first Orthogonal Frequency-Division Multiplexing (OFDM) signal and a second OFDM signal that are multiplexed, to generate a first modulated symbol sequence and a second modulated symbol sequence each corresponding to a determined channel, decoding each of the first modulated symbol sequence and the second modulated symbol sequence to generate a video signal or an audio signal; displaying the video signal on a monitor; and outputting the audio signal from a speaker, wherein a plurality of pilot symbols are inserted into each of the first modulated symbol sequence and the second modulated symbol sequence in accordance with a determined timing, the first modulated symbol sequence and the second modulated symbol sequence, each into which the plurality of pilot symbols are inserted, are phase-shifted using a phase shift coefficient that is regularly switched between a plurality of phase shift coefficients to generate a first phase-shifted symbol sequence and a second phase-shifted symbol sequence, respectively, the first phase-shifted symbol sequence is converted into the first OFDM signal, the second phase-shifted symbol sequence is converted into the second OFDM signal, the first OFDM signal is transmitted from a first transmission branch at a first frequency and a first time, the second OFDM signal is transmitted from a second transmission branch at the first frequency and at the first time, the plurality of phase shift coefficients include a first phase amount that regularly varies, the first OFDM signal includes a first subcarrier signal, a second subcarrier signal, and a third subcarrier signal that are consecutive in a frequency domain, the second OFDM signal includes a fourth subcarrier signal, a fifth subcarrier signal, and a sixth subcarrier signal that are consecutive in the frequency domain, the second subcarrier signal and the fifth subcarrier signal include the plurality of pilot symbols arranged at the same frequency, and a difference in terms of phase amount included in a phase shift coefficient between a first symbol arranged in the first subcarrier signal and a second symbol arranged in the third subcarrier signal is twice the first phase amount.
 4. A reception device comprising: tuner circuitry which, in operation, demultiplexes a multiplexed signal including a first Orthogonal Frequency-Division Multiplexing (OFDM) signal and a second OFDM signal that are multiplexed, to generate a first modulated symbol sequence and a second modulated symbol sequence each corresponding to a determined channel, decoding circuitry which, in operation, decodes each of the first modulated symbol sequence and the second modulated symbol sequence to generate a video signal or an audio signal; displaying the video signal on a monitor; and outputting the audio signal from a speaker, wherein a plurality of pilot symbols are inserted into each of the first modulated symbol sequence and the second modulated symbol sequence in accordance with a determined timing, the first modulated symbol sequence and the second modulated symbol sequence, each into which the plurality of pilot symbols are inserted, are phase-shifted using a phase shift coefficient that is regularly switched between a plurality of phase shift coefficients to generate a first phase-shifted symbol sequence and a second phase-shifted symbol sequence, respectively, the first phase-shifted symbol sequence is converted into the first OFDM signal, the second phase-shifted symbol sequence is converted into the second OFDM signal, the first OFDM signal is transmitted from a first transmission branch at a first frequency and a first time, the second OFDM signal is transmitted from a second transmission branch at the first frequency and at the first time, the plurality of phase shift coefficients include a first phase amount that regularly varies, the first OFDM signal includes a first subcarrier signal, a second subcarrier signal, and a third subcarrier signal that are consecutive in a frequency domain, the second OFDM signal includes a fourth subcarrier signal, a fifth subcarrier signal, and a sixth subcarrier signal that are consecutive in the frequency domain, the second subcarrier signal and the fifth subcarrier signal include the plurality of pilot symbols arranged at the same frequency, and a difference in terms of phase amount included in a phase shift coefficient between a first symbol arranged in the first subcarrier signal and a second symbol arranged in the third subcarrier signal is twice the first phase amount. 